Skeleton-based Hierarchical Shape Segmentation

We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of a critical points on the curve skeleton, either fully automatically as the junctions of the curve skeleton, or based on user input. We use these points to construct a partitioning of the object surface using geodesics. Since it is based on the curve skeleton, our segmentation intrinsically reflects the shape symmetry and topology. By using geodesics we obtain segments that have smooth, minimally twisting borders. Finally, we present a hierarchical segmentation of shapes which reflects the hierarchical structure of the curve skeleton. We describe a voxel-based implementation of our method which is robust and noise resistant, computationally efficient, able to handle shapes of complex topology, and which delivers levelof-detail segmentations. We demonstrate the framework on various real-world 3D shapes.

• Type: Conference
• Year: 2007
• Where: SMI
• Authors: Dennie Reniers, Alexandru Telea
• Keywords: Curve Skeleton, Effective Framework, Real-world 3D Shapes, SMI 2007