Computer Science Technical Reports
CS at VT

Decomposing Rectilinear Figures into Rectangles

Chadha, Ritu and Allison, Donald C. S. (1988) Decomposing Rectilinear Figures into Rectangles. Technical Report TR-88-17, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-88-17.pdf (1466763)


We discuss the problem of decomposing rectilinear regions, with or without holes, into a minimum number of rectangles. There are two different problems considered here: decomposing a figure into non-overlapping parts, called partitioning, and decomposing a figure into possibly overlapping parts, called covering. A method is outlined and proved for solving the above two problems, and algorithms for the solutions of these problems are presented. The partitioning problem can be solved in time O(n-to the 5/2), where n is the number of vertices of the figure, whereas the covering problem is exponential in its time complexity.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:102
Deposited By:User autouser
Deposited On:05 December 2001