Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Parts of Visual Form: Computational Aspects
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analyzing nonconvex 2D and 3D patterns
Computer Vision and Image Understanding
Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
Convex Decomposition of Simple Polygons
ACM Transactions on Graphics (TOG)
The Power of Non-Rectilinear Holes
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Bounds on the Length of Convex Partitions of Polygons
Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Polygon decomposition based on the straight line skeleton
Proceedings of the nineteenth annual symposium on Computational geometry
Decomposing a polygon into its convex parts
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Approximate convex decomposition
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Shape partitioning by convexity
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Technical Section: Point-in-polygon tests by convex decomposition
Computers and Graphics
Weighted skeletons and fixed-share decomposition
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We propose a strategy to decompose a polygon, containing zero or more holes, into "approximately convex" pieces. For many applications, the approximately convex components of this decomposition provide similar benefits as convex components, while the resulting decomposition is significantly smaller and can be computed more efficiently. Moreover, our approximate convex decomposition (ACD) provides a mechanism to focus on key structural features and ignore less significant artifacts such as wrinkles and surface texture. We propose a simple algorithm that computes an ACD of a polygon by iteratively removing (resolving) the most significant non-convex feature (notch). As a by product, it produces an elegant hierarchical representation that provides a series of 'increasingly convex' decompositions. A user specified tolerance determines the degree of concavity that will be allowed in the lowest level of the hierarchy. Our algorithm computes an ACD of a simple polygon with n vertices and r notches in O(nr) time. In contrast, exact convex decomposition is NP-hard or, if the polygon has no holes, takes O(nr2) time. Models and movies can be found on our web-pages at: http://parasol.tamu.edu/groups/amatogroup/.