Fast heuristics for minimum length rectangular partitions of polygons

Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986

Volumn , Issue , 1986, Pages 100-108

  Levcopoulos, Christos ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; DIVIDE-AND-CONQUER TECHNIQUE; FAST HEURISTICS; FAST METHODS; GENERALIZED VORONOI DIAGRAM; PLANE SWEEPING; RECTANGULAR PARTITION; TOTAL LENGTH;

COMPUTATIONAL GEOMETRY;

EID: 84957811276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/10515.10526     Document Type: Conference Paper

References (15)

1. Chew, L.P., and Drysdale, R.L., "Voronoi Diagrams Based on Convex Distance Functions", Proc. First ACM Symposium on Computational Geometry, Baltimore, June 1985.
2. Fortune, S.J., "A Fast Algorithm for Polygon Containment by Translation", Proc. 12th ICALP, Naf-plion, Greece, 1985.
3. Gonzalez, T., and S.Q. Zheng, "Bounds for Partitioning Rectilinear Polygons" Proc. First ACM Symposium on Computational Geometry, Baltimore, June 1985.
4. Imai, H., and Asano, T., "Dynamic Intersection Search with Applications", Proc. 25th IEEE FOCS Symp., Florida, 1984.
5. Keil, J.M., and J.R. Sack, "Minimum Decompositions of Polygonal Objects", SCS-TR-42, Carleton University, Ottawa.
6. Kirkpatrick, D.G., "An upper bound for sorting integers in restricted ranges", Proc. 18th Allerton Conf. on Comm. Control and Computing, Illinois, (Oct. 1980).
7. Levcopoulos, C, "Minimum Length and 'Thickest-First' Rectangular Partitions of Polygons", Proc. 23rd Allerton Conf. on Comm. Control and Computing, Illinois, October 1985.
8. Levcopoulos, C, "Heuristics for Decomposing Polygons into Rectangles" (preliminary title), in preparation, Linkoping.
9. Levcopoulos, C, and A. Lingas, "Bounds on the Length of Convex Partitions of Polygons", Proc. 4th Conf. on Found, of Software Technology and Theoretical Computer Science, Bangalore, India, 1984 (Springer Verlag).
10. Lingas, A., "Heuristics for Minimum Edge Length Rectangular Partitions of Rectilinear Figures", Proc. 6th GI-Conference, Dortmund, January 1983 (Springer Verlag).
11. Lloyd, E.L., "On Triangulations of a Set of Points in the Plane", Proc. of 18th IEEE Conf. on Foundations of Comp. Sc., Providence, 1977.
12. Lingas, A., R.Y. Pinter, R.L. Rivest, and A. Shamir, "Minimum Edge Length Partitioning of Rectilinear Polygons", Proc. 20th Allerton Conf. on Comm. Control and Compt., Illinois, 1982.
13. Preparata, F.P., and M.I. Shamos, "Computational Geometry", New York Springer-Verlag, 1985.
14. Rivest, R., "The PI (Placement and Interconnect) System", Proc. 19th Design Automation Conference, June 1982.
15. Rivest, R., Private Communication, October 1985.