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
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimum K-partitioning of rectilinear polygons
Journal of Symbolic Computation
Spatial decomposition of a tumor into a minimum number of spherical components
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Decomposing polygonal regions into convex quadrilaterals
SCG '85 Proceedings of the first annual symposium on Computational geometry
Bounds for partitioning rectilinear polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
An Algorithm for Filling Regions on Graphics Display Devices
ACM Transactions on Graphics (TOG)
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
Convex decompositions of polyhedra
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters
Minimum weight convex Steiner partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Weighted skeletons and fixed-share decomposition
Computational Geometry: Theory and Applications
Digitization scheme that assures faithful reconstruction of plane figures
Pattern Recognition
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Linear-time 3-approximation algorithm for the r-star covering problem
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Scaling of plane figures that assures faithful digitization
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
ACCORD: with approximate covering of convex orthogonal decomposition
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
IEEE/ACM Transactions on Networking (TON)
Approximate partitioning of 2D objects into orthogonally convex components
Computer Vision and Image Understanding
| Hi-index | 0.02 |
A common operation in geometric computing is the decomposition of complex structures into more basic structures. Since it is easier to apply most algorithms to triangles or arbitrary convex polygons, there is considerable interest in finding fast algorithms for such decompositions. We consider the problem of decomposing a simple (non-convex) polygon into the union of a minimal number of convex polygons. Although the structure of the problem led to the conjecture that it was NP-complete, we have been able to reach polynomial time bounded algorithms for exact solution as well as low degree polynomial time bounded algorithm/or approximation methods.