Sciweavers

CGF
2007

Mesh Segmentation via Spectral Embedding and Contour Analysis

13 years 2 months ago
Mesh Segmentation via Spectral Embedding and Contour Analysis
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is extracted from the planar embedding. We rely on two operators to compute the projection: the well-known graph Laplacian and a geometric operator designed to emphasize concavity. The two embeddings reveal distinctive shape semantics of the 3D model and complement each other in capturing the structural or geometrical aspect of a segmentation. Transforming the shape analysis problem to the 2D domain also facilitates our segmentability analysis and sampling tasks. We propose a novel measure of the segmentability of a shape, which is used as the stopping criterion for our segmentation. The measure is derived from simple area- and perimeter-based convexity measures. We achieve invariance to shape bending through multi-dimensional scaling (MDS) based on the notion of inner distance. We also utilize inner distances t...
Rong Liu, Hao Zhang 0002
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2007
Where CGF
Authors Rong Liu, Hao Zhang 0002
Comments (0)