Bounds for partitioning rectilinear polygons

Proceedings of the 1st Annual Symposium on Computational Geometry, SCG 1985

Volumn , Issue , 1985, Pages 281-287

  Gonzalez, Teofilo ^a   Zheng, Si Qing ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Partition of rectilinear polygons; Polynomial time complexity

Indexed keywords

COMPUTATIONAL GEOMETRY; POLYNOMIAL APPROXIMATION;

APPROXIMATION BOUNDS; EFFICIENT APPROXIMATION ALGORITHMS; INTERIOR POINT; LINE SEGMENT; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; POLYNOMIAL TIME COMPLEXITY; SET OF LINES;

APPROXIMATION ALGORITHMS;

EID: 84957809915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/323233.323269     Document Type: Conference Paper

References (10)

1. [AHU] Aho, A. V., J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. [AT] Avis, D. and G. T. Toussaint, An Efficient Algorithm for Decomposing a Polygon into Star- shaped Polygons, Pattern Recognition, Vol. 13, 1981.
3. [CD] Chazelle, B. and D. Dobkin, Decomposing a Polygon into its Convex Parts: Proc. 11th ACM Symp. on Theory of Comput., 1979.
4. [GJPT] Garey, M R, D. S. Johnson, F. P. Preparata and R. E. Tarjan. Triangulating a Simple Polygon; Information Processing Letters, Vol. 7, No. 4, (June 1978).
5. [GZ] Gonzalez, T. and S-Q. Zheng, Approximation Algo rithms for Partitioning Rectilinear Polygons. Technical Report. University of California, Santa Barbara, March 1985.
6. [LLMP] Lodi, E., F. Luccio, C. Mugnai, and L Pagli, On Two-dimensional Data Organization !; Panda- mania Informaticae, Vol. 2, No. 2 (1979).
7. [LLMPL] Lodi, E. F, Luccio, C., Mugnai, L, Pag, L and W. Lipski Jr., On Two-dimensional Data Organization II; Fundamentl Inforrnaticae, Vol. 2, No. 3 (1979).
8. [LPRS] Lingas, A., R Y. Pinter, R L. Rivest, and A. Shamir, Minimum Edge Length Partitioning of Rectilinear Polygons, Proc. 20th Annual Allerton Conference on Communication, Control, and Computing, Monticello. Illinois, Oct. 1982.
9. [R] Rivest, R L. The PI (Placement and Intercon nect) System, Proc. 19th Design Automation Conference, June 1982.
10. [S] Sack, J. R, An 0( n log n ) Algorithm for Decom posing Simple Rectilinear Polygons into Convex Quadrilaterals, Proc, 20th Annual Allerton Conference on Communication, Control and Computing, Oct. 1982.