Decomposing Polygon Meshes by Means of Critical Points

Authors:
Yinan Zhou;Zhiyong Huang
Affiliations:
-;-
Venue:
MMM '04 Proceedings of the 10th International Multimedia Modelling Conference
Year:
2004

Citing 0
Cited 6

A Java3D framework for inspecting and segmenting 3D models

Web3D '08 Proceedings of the 13th international symposium on 3D web technology
3D Mesh Exploration for Smart Visual Interfaces

VISUAL '08 Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management
Shape decomposition using Farey sequence and saddle points

Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
Schelling points on 3D surface meshes

ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Probabilistic implications

Fuzzy Sets and Systems
High-quality vertex clustering for surface mesh segmentation using Student-t mixture model

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Polygon mesh is among the most common data structuresused for representing objects in computer graphics.Unfortunately, a polygon mesh does not capture high-levelstructures, unlike a hierarchical model. In general, high-levelabstractions are useful for managing data in applications. Inthis paper, we present a method for decomposing an objectrepresented in polygon meshes into components by means ofcritical points. The method consists of steps to define the rootvertex of the object, define a function on the polygon meshes,compute the geodesic tree and critical points, decide thedecomposition order, and extract components usingbackwards flooding. We have implemented the method. Thepreliminary results show that it works effectively andefficiently. The decomposition results can be useful forapplications such as 3D model retrieval and morphing.