Partitioning rectilinear figures into rectangles
Ritu Chadha, Donald C. S. Allison · 1988
This paper discusses the problem of partitioning rectilinear regions, with or without holes, into a minimum number of rectangles. An algorithm which solves this partitioning problem in time O(n5/2), where n is the number of vertices of the rectilinear figure, is presented.