A novel method for segmenting simplified skeletons of 3D shapes is presented. The so-called simplified Y-network is computed, defining boundaries between 2D sheets of the simplified 3D skeleton, which we take as our skeleton segments. We compute the simplified Y-network using a robust importance measure which has been proved useful for simplifying complex 3D skeleton manifolds. We present a voxel-based algorithm and show results on complex real-world objects, including ones containing large amounts of boundary noise.
|Title of host publication||Discrete Geometry for Computer Imagery (Proceedings 14th IAPR International Conference, DGCI'08, Lyon, France, April 16-18, 2008)|
|Editors||D. Coeurjolly, I. Sivignon, L. Tougne, F. Dupont|
|Place of Publication||Berlin|
|Publication status||Published - 2008|
|Name||Lecture Notes in Computer Science|