Partitioning a polygonal region into trapezoids
Journal of the ACM (JACM)
Minimally covering a horizontally convex orthogonal polygon
SCG '86 Proceedings of the second annual symposium on Computational geometry
Efficient algorithms for geometric graph search problems
SIAM Journal on Computing
Art gallery theorems and algorithms
Art gallery theorems and algorithms
Efficient structures for geometric data management
Efficient structures for geometric data management
Bounds for partitioning rectilinear polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
Proceedings of the Fifth International Conference on Data Engineering
The Power of Non-Rectilinear Holes
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Decomposing a polygon into its convex parts
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
IEEE Transactions on Computers
Decomposition of Polygons into Convex Sets
IEEE Transactions on Computers
Minimum partition of polygonal regions into trapezoids
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
A Polygon-to-Rectangle Conversion Algorithm
IEEE Computer Graphics and Applications
Some NP-hard polygon decomposition problems
IEEE Transactions on Information Theory
Fast algorithm for polygon decomposition
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
A minimum k-partition decomposes a rectilinear polygon with n vertices into aminimum number of disjoint rectilinear components with no more than k vertices each (k=8; most results are also new for k=6.