Strategies for polyhedral surface decomposition: an experimental study
Proceedings of the eleventh annual symposium on Computational geometry
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Decomposing polygon meshes for interactive applications
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Curvature Tensor Based Triangle Mesh Segmentation with Boundary Rectification
CGI '04 Proceedings of the Computer Graphics International
ACM SIGGRAPH 2004 Papers
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
Hierarchical mesh segmentation based on fitting primitives
The Visual Computer: International Journal of Computer Graphics
Approximate convex decomposition of polyhedra
Proceedings of the 2007 ACM symposium on Solid and physical modeling
As-rigid-as-possible surface modeling
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Part-Based Annotation of Virtual 3D Shapes
CW '07 Proceedings of the 2007 International Conference on Cyberworlds
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
SMI 2011: Full Paper: An approach to automated decomposition of volumetric mesh
Computers and Graphics
SMI 2012: Full α-Decomposition of polygons
Computers and Graphics
Co-abstraction of shape collections
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Weak convex decomposition by lines-of-sight
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be browsed at interactive speed on a modern PC and it is useful for implementing an intuitive feature selection paradigm for 3D editing environments. Convex parts often coincide with perceptually relevant shape components and, for their identification, existing methods rely on the boundary surface only. In contrast, we show that the notion of part concavity can be expressed and implemented more intuitively and efficiently by exploiting a tetrahedrization of the shape volume. The method proposed is completely automatic, and generates a tree of convex polyhedra in which the root is the convex hull of the whole shape, and the leaves are the tetrahedra of the input mesh. The algorithm proceeds bottom-up by hierarchically clustering tetrahedra into nearly convex aggregations, and the whole process is significantly fast. We prove that, in the average case, for a mesh of n tetrahedra O(n log2 n) operations are sufficient to compute the whole tree.