Minimum partitioning simple rectilinear polygons in O(n log log n) - time

Authors:
W. T. Liou;J. J. Tan;R. C. Lee
Affiliations:
Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.;Institute of Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.;National Tsing Hua University, Hsinchu, Taiwan, and the Academia Sinica, Taipei, Taiwan, R.O.C.
Venue:
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Year:
1989

Citing 6
Cited 6

Polygon triangulation: efficiency and minimality

Journal of Algorithms
An algorithm for covering polygons with rectangles

Information and Control
Efficient algorithms for geometric graph search problems

SIAM Journal on Computing
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
An O (n log log n)-time algorithm for triangulating a simple polygon

SIAM Journal on Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Polygon triangulation in O(n log log n) time with simple data-structures

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient decomposition of polygons into L-shapes with application to VLSI layouts

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Lower bounds for approximate polygon decomposition and minimum gap

Information Processing Letters
The structure of optimal partitions of orthogonal polygons into fat rectangles

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Information-driven sensor path planning by approximate cell decomposition

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Decomposition of binary images-A survey and comparison

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract