Meaningful Mesh Segmentation Guided by the 3D Short-Cut Rule

Extended from the 2D silhouette-parsing short-cut rule [25], a 3D short-cut rule, which states "as long as a cutting path mainly crosses local skeleton and lies in concave regions, the shorter path is (other things being equal) the better", is defined in the paper. Guided by the 3D short-cut rule, we propose a hierarchical model decomposition paradigm, which integrates the advantages of the skeleton-driven and minima-rule-based meaningful segmentation. Our method defines geometrical and topological functions of skeleton to locate initial critical cutting points, and then employs salient contours with negative minimal principal curvature values to determine natural boundary curves among parts. Sufficient experiments have been carried out on many meshes, and have shown that our framework could provide more perceptual results than pure skeleton-driven or minima-rule-based algorithm.

[1]  Ayellet Tal,et al.  Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003, ACM Trans. Graph..

[2]  Balasubramanian Raman,et al.  Computing hierarchical curve-skeletons of 3D objects , 2005, The Visual Computer.

[3]  Ayellet Tal,et al.  Mesh segmentation using feature point and core extraction , 2005, The Visual Computer.

[4]  T. Funkhouser,et al.  A planar-reflective symmetry transform for 3D shapes , 2006, SIGGRAPH '06.

[5]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

[6]  Marco Attene,et al.  Hierarchical mesh segmentation based on fitting primitives , 2006, The Visual Computer.

[7]  Mongi A. Abidi,et al.  Perception-based 3D triangle mesh segmentation using fast marching watersheds , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[8]  Donald D. Hoffman,et al.  Parsing silhouettes: The short-cut rule , 1999, Perception & psychophysics.

[9]  Hans-Peter Seidel,et al.  Mesh scissoring with minima rule and part salience , 2005, Comput. Aided Geom. Des..

[10]  Deborah Silver,et al.  Curve-skeleton applications , 2005, VIS 05. IEEE Visualization, 2005..

[11]  Hao Zhang,et al.  Segmentation of 3D meshes through spectral clustering , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[12]  Huafeng Liu,et al.  The progressive mesh compression based on meaningful segmentation , 2007, The Visual Computer.

[13]  Arie E. Kaufman,et al.  Incremental Triangle Voxelization , 2000, Graphics Interface.

[14]  Donald D. Hoffman,et al.  Parts of recognition , 1984, Cognition.

[15]  Marco Attene,et al.  Mesh Segmentation - A Comparative Study , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[16]  Konstantin Mischaikow,et al.  Feature-based surface parameterization and texture mapping , 2005, TOGS.

[17]  J. Rossignac,et al.  Plumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies , 2004, SM '04.

[18]  Nancy M. Amato,et al.  Simultaneous shape decomposition and skeletonization , 2006, SPM '06.

[19]  Kaleem Siddiqi,et al.  Divergence-Based Medial Surfaces , 2000, ECCV.

[20]  Mohamed Daoudi,et al.  Topology driven 3D mesh hierarchical segmentation , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).

[21]  Pedro V. Sander,et al.  Texture mapping progressive meshes , 2001, SIGGRAPH.

[22]  H. Shum,et al.  Subspace gradient domain mesh deformation , 2006, SIGGRAPH 2006.

[23]  Edith Schonberg,et al.  Two-Dimensional, Model-Based, Boundary Matching Using Footprints , 1986 .

[24]  Daniel Cohen-Or,et al.  Special Issue: PG2004 , 2006, Graph. Model..

[25]  Amy A. Gooch,et al.  Graphics Interface 2007 , 2007 .

[26]  S. Stahl Introduction to Topology and Geometry , 1970 .

[27]  Hiromasa Suzuki,et al.  Making Papercraft Toys from Meshes using Strip-based Approximate Unfolding , 2004 .

[28]  Donald D. Hoffman,et al.  Salience of visual parts , 1997, Cognition.

[29]  Tiow Seng Tan,et al.  Decomposing polygon meshes for interactive applications , 2001, I3D '01.