A simple and efficient approach for 3D mesh approximate convex decomposition

• Published in: 2009 16th IEEE International Conference on Image Processing (ICIP) pp. 3501 - 3504
• Main Authors: Mamou, K., Ghorbel, F.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2009
• Subjects: 3D mesh; Anatomical structure; Animation; Approximate convex decomposition; Clustering algorithms; collision detection; Cost function; Face detection; Games; hierarchical segmentation; Mesh generation; Pattern analysis; Shape; Skeleton
• ISBN: 9781424456536; 1424456533
• ISSN: 1522-4880
• DOI: 10.1109/ICIP.2009.5414068

This paper presents an original approach for 3D mesh approximate convex decomposition. The proposed algorithm computes a hierarchical segmentation of the mesh triangles by applying a set of topological decimation operations to its dual graph. The decimation strategy is guided by a cost function describing the concavity and the shape of the detected clusters. The generated segmentation is finally exploited to construct a faithful approximation of the original mesh by a set of convex surfaces. This new representation is particularly adapted for collision detection. The experimental evaluation we conducted shows that the proposed technique efficiently decomposes a concave 3D mesh into a small set (with respect to the number of its facets) of nearly convex surfaces. Furthermore, it automatically detects the anatomical structure of the analyzed 3D models, which makes it an ideal candidate for skeleton extraction and patterns recognition applications.