Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles

In this paper, the problem of dissecting a plane rectilinear polygon with arbitrary (possibly, degenerate) holes into a minimum number of rectangles is shown to be solvable inO(n3/2 logn) time. This fact disproves a famous assertion about the NP-hardness of the minimum rectangular dissection problem for rectilinear polygons with point holes.

[1]  Jack Sklansky,et al.  Minimal rectangular partitions of digitized blobs , 1984, Comput. Vis. Graph. Image Process..

[2]  Witold Lipski,et al.  An O(n log n) Manhattan Path Algorithm , 1984, Inf. Process. Lett..

[3]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[4]  Witold Lipski,et al.  Finding a manhattan path and related problems , 1983, Networks.

[5]  Takao Asano,et al.  Efficient Algorithms for Geometric Graph Search Problems , 1986, SIAM J. Comput..