Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
International Journal of Computer Vision
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
ACM SIGGRAPH 2004 Papers
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Segmentation of 3D Meshes through Spectral Clustering
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Feature Sensitive Mesh Segmentation with Mean Shift
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Mesh analysis using geodesic mean-shift
The Visual Computer: International Journal of Computer Graphics
Mesh Segmentation - A Comparative Study
SMI '06 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006
Random Walks for Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A tutorial on spectral clustering
Statistics and Computing
Consistent mesh partitioning and skeletonisation using the shape diameter function
The Visual Computer: International Journal of Computer Graphics
Fast mesh segmentation using random walks
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Randomized cuts for 3D mesh analysis
ACM SIGGRAPH Asia 2008 papers
A benchmark for 3D mesh segmentation
ACM SIGGRAPH 2009 papers
Mesh scissoring with minima rule and part salience
Computer Aided Geometric Design - Special issue: Geometry processing
Scale-Space Analysis of Discrete Filtering over Arbitrary Triangulated Surfaces
SIAM Journal on Imaging Sciences
Learning 3D mesh segmentation and labeling
ACM SIGGRAPH 2010 papers
Convergence, stability, and discrete approximation of Laplace spectra
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
New spectral methods for ratio cut partitioning and clustering
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Surface perception of planar abstractions
ACM Transactions on Applied Perception (TAP) - Special issue SAP 2013
SMI 2013: New evaluation metrics for mesh segmentation
Computers and Graphics
Mesh saliency via spectral processing
ACM Transactions on Graphics (TOG)
Key-components: detection of salient regions on 3D meshes
The Visual Computer: International Journal of Computer Graphics
Weak convex decomposition by lines-of-sight
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
The problem of decomposing a 3D mesh into meaningful segments (or parts) is of great practical importance in computer graphics. This article presents a variational mesh decomposition algorithm that can efficiently partition a mesh into a prescribed number of segments. The algorithm extends the Mumford-Shah model to 3D meshes that contains a data term measuring the variation within a segment using eigenvectors of a dual Laplacian matrix whose weights are related to the dihedral angle between adjacent triangles and a regularization term measuring the length of the boundary between segments. Such a formulation simultaneously handles segmentation and boundary smoothing, which are usually two separate processes in most previous work. The efficiency is achieved by solving the Mumford-Shah model through a saddle-point problem that is solved by a fast primal-dual method. A preprocess step is also proposed to determine the number of segments that the mesh should be decomposed into. By incorporating this preprocessing step, the proposed algorithm can automatically segment a mesh into meaningful parts. Furthermore, user interaction is allowed by incorporating the user's inputs into the variational model to reflect the user's special intention. Experimental results show that the proposed algorithm outperforms competitive segmentation methods when evaluated on the Princeton Segmentation Benchmark.