将矩形划分为较小的重叠的算法？

Question

将矩形(c struct为4 ints)划分为随机数的较小矩形(返回structs 列表)的算法是什么？如果可以通过参数控制较小矩形的最大和最小尺寸,则更好.

例如

+----------+            +-------+--+
|          |            |       |  |
|          |            |       |  |
|          |    -->     |---+---+--| (good)
|          |            |   |      |
|          |            +---+      |
|          |            |   |      |
+----------+            +---+------+

较小的形状应该是4面,以下不好:

+----------+            +-------+--+
|          |            |       |  |
|          |            |       |  |
|          |    -->     |---+---+--| (not good)
|          |            |          |
|          |            +---+      |
|          |            |   |      |
+----------+            +---+------+

谢谢!

附录:( Moron讨论的矩形)

  +----+--------+
  |    |        |
  |    +---+----+
  |    |   |    | (rectangle-chase)
  +----+---+    |
  |        |    |
  +--------+----+

Answer 1

将矩形拆分为两个.递归.