"Shape-Curvature-Graph": Towards a New Model of Representation for the Description of 3D Meshes

This paper presents a new shape descriptor for 3D meshes, that aims at representing an arbitrary triangular polyhedron using a graph, called SCG for “Shape-Curvature-Graph”. This entity can be used to perform self-similarity detection, or more generally to extract patterns within a shape. Our method uses discrete curvature maps and divides the meshes into eight categories of patches (peak, ridge, saddle ridge, minimal, saddle valley, valley, pit and flat). Then an adjacency graph is constructed with a node for each patch. All categories of patches cannot be neighbors in a continuous context, thus additional intermediary patches are added as boundaries to ensure a continuous consistency at the transitions between areas. To validate the relevance of this modular structure, an approach based of these shape descriptor graphs is developed in order to extract similar patterns within a surface mesh. It illustrates that these “augmented” graphs obtained using differential properties on meshes can be used to analyze shape and extract features.

[1]  Ligang Liu,et al.  3D Shape Segmentation and Labeling via Extreme Learning Machine , 2014, Comput. Graph. Forum.

[2]  Stefan Gumhold,et al.  Feature Extraction From Point Clouds , 2001, IMR.

[3]  Shi-Min Hu,et al.  Robust principal curvatures on multiple scales , 2006, SGP '06.

[4]  Sven J. Dickinson,et al.  Skeleton based shape matching and retrieval , 2003, 2003 Shape Modeling International..

[5]  Mark Meyer,et al.  Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[6]  Ramesh C. Jain,et al.  Segmentation through Variable-Order Surface Fitting , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Xi Zhang,et al.  3D Mesh Segmentation Using Mean-Shifted Curvature , 2008, GMP.

[8]  Mladen Nikolic,et al.  Measuring similarity of graph nodes by neighbor matching , 2012, Intell. Data Anal..

[9]  Hans-Peter Seidel,et al.  Relating shapes via geometric symmetries and regularities , 2014, ACM Trans. Graph..

[10]  Huy Tho Ho,et al.  Curvature-based approach for multi-scale feature extraction from 3D meshes and unstructured point clouds , 2009, DICTA 2009.

[11]  Hans-Peter Seidel,et al.  Fast and robust detection of crest lines on meshes , 2005, SPM '05.

[12]  Konrad Polthier,et al.  Smooth feature lines on surface meshes , 2005, SGP '05.

[13]  Jean-Luc Mari,et al.  Skeleton Extraction of Vertex Sets Lying on Arbitrary Triangulated 3D Meshes , 2013, DGCI.

[14]  Yong-Liang Yang,et al.  Multi-Scale Salient Features for Analyzing 3D Shapes , 2012, Journal of Computer Science and Technology.

[15]  Leonidas J. Guibas,et al.  Near-Regular Structure Discovery Using Linear Programming , 2014, ACM Trans. Graph..

[16]  David W. Jacobs,et al.  Mesh saliency , 2005, SIGGRAPH 2005.

[17]  Daniel Cohen-Or,et al.  Salient geometric features for partial shape matching and similarity , 2006, TOGS.

[18]  Atilla Baskurt,et al.  A new CAD mesh segmentation method, based on curvature tensor analysis , 2005, Comput. Aided Des..

[19]  Evangelos Kalogerakis,et al.  Folding meshes: hierarchical mesh segmentation based on planar symmetry , 2006, SGP '06.

[20]  Daniel Cremers,et al.  Robust Region Detection via Consensus Segmentation of Deformable Shapes , 2014, Comput. Graph. Forum.

[21]  Derek Nowrouzezahrai,et al.  Multi‐objective shape segmentation and labeling , 2009, Comput. Graph. Forum.