Abstract
We consider the problem of partitioning rectilinear polygons into rectangles, using segments of minimum total length. This problem is NP-hard for polygons with holes. Even for hole-free polygons no known algorithm can find an optimal partitioning in less than O(n 4) time.
We present the first linear-time algorithm for computing rectangulations of hole-free polygons, within a constant factor of the optimum. We achieve this result by deriving a linear-time algorithm for producing rectangulations of histograms of length less than 2.42 times the optimum, and then solving the problem of producing a proper partition into histograms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chazelle, B.: Triangulating a Simple Polygon in Linear Time. Proc. 31st Symp. on Foundations of Computer Science, pp. 220–230, 1990.
Chin, F., Snoeyink, J., Wang, C.A.: Finding the Medial Axis of a Simple Polygon in Linear Time. Proc., 6th International Symposium on Algorithms and Computation, ISAAC '95, Cairns, Australia, 1995. (LNCS 1006, Springer Verlag).
Gabow, H., Bentley, J., Tarjan, R.: Scaling and Related Techniques for Geometry Problems. Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 135–143, April 1984.
Gonzalez, T, Zheng, S.Q.: Bounds for Partitioning Rectilinear Polygons. Proc. First ACM Symposium on Computional Geometry, Baltimore, June 1985.
Harel, D., Tarjan, R.E.: Fast Algorithms for Finding Nearest Common Ancestors. SIAM Journal of Computing, Vol. 13, No. 2, May 1984.
Levcopoulos, C.: Minimum Length and “Thickest-first” Rectangular partitions of Polygons. Proc. 20th Allerton Conf. on Comm. Control and Compt., Monticello, Illinois, 1982.
Levcopoulos, C.: Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. In Proc. of the 2nd ACM Symp. on Comp. Geomety, pp. 100–108, 1986.
Levcopoulos, C.: Heuristics for Minimum Decompositions of Polygons. PhD dissertation no. 155, Linköping University, 1987.
Levcopoulos, C., Östlin, A.: Linear-Time Heuristics for Minimum Weight Rectangulation. Technical Report LU-CS-TR:96-165, Lund University, 1996.
Lingas, A.: Heuristics for Minimum Edge Length Rectangular Partitions of Rectilinear Figures. Proc. 6th GI-Conference, Dortmund, January 1983. (LNCS 145, Springer Verlag).
Levcopoulos, C., Lingas, A.: Bounds on the Length of Convex Partitions of Polygons. Proc. 4th Conference on Found. of Software Technology and Theoretical Computer Science, Bangalore, India, 1984. (LNCS 181, Springer Verlag).
Lingas, A., Pinter, R.Y., Rivest, R.L. Shamir, A.: Minimum Edge Length Partitioning of Rectilinear Polygons. Proc. 20th Allerton Conf. on Comm. Control and Compt., Monticello, Illinois, 1982.
Vuillemin, J.: A Unifying Look at Data Structures. Communications of the ACM, Vol. 23 (4), April 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levcopoulos, C., Östlin, A. (1996). Linear-time heuristics for minimum weight rectangulation. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_138
Download citation
DOI: https://doi.org/10.1007/3-540-61422-2_138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61422-7
Online ISBN: 978-3-540-68529-6
eBook Packages: Springer Book Archive