3d Mesh Segmentation Using Local Geometry
نویسنده
چکیده
We develop an algorithm to segment a 3D surface mesh intovisually meaningful regions based on analyzing the local geometry ofvertices. We begin with a novel characterization of mesh vertices as convex,concave or hyperbolic depending upon their discrete local geometry.Hyperbolic and concave vertices are considered potential feature regionboundaries. We propose a new region growing technique starting fromthese boundary vertices leading to a segmentation of the surface thatis subsequently simplified by a region-merging method. Experiments indicatethat our algorithm segments a broad range of 3D models at aquality comparable to existing algorithms. Its use of methods that belongnaturally to discretized surfaces and ease of implementation makeit an appealing alternative in various applications.
منابع مشابه
Analysis of Global Properties of Shapes
With increasing amounts of data describing 3D geometry at scales small and large, shape analysis is becoming increasingly important in fields ranging from computer graphics to robotics to computational biology. While a great deal of research exists on local shape analysis, less work has been done on global shape analysis. This thesis aims to advance global shape analysis in three directions: sy...
متن کاملImproved Curvature Estimation for Watershed Segmentation of 3-Dimensional Meshes
Segmentation of a 3-dimensional (3D) polygonal mesh is a method of breaking the mesh down into \meaningful" connected subsets of vertices called regions. The method used here is based on the watershed segmentation scheme which appears prominently in the image segmentation literature and was later applied to the 3D segmentation problem. The watershed algorithm is based on a scalar value (curvatu...
متن کاملA Novel Method for 3D Surface Mesh Segmentation
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In our algorithm, vertices of the same group of surface types are allowed to join a segment. The geodesic distance is estimated using shortest path between connected vertices, which can be computed from well known algorithm...
متن کامل3D Building Models Segmentation Based on K-means++ Cluster Analysis
3D mesh model segmentation is drawing increasing attentions from digital geometry processing field in recent years. The original 3D mesh model need to be divided into separate meaningful parts or surface patches based on certain standards to support reconstruction, compressing, texture mapping, model retrieval and etc. Therefore, segmentation is a key problem for 3D mesh model segmentation. In ...
متن کاملA Unified 3D Mesh Segmentation Framework Based on Markov Random Field
3D Mesh segmentation has become an important research field in computer graphics during the past decades. Many geometry based and semantic oriented approaches for 3D mesh segmentation has been presented. In this paper, we present a definition of mesh segmentation according to labeling problem. Inspired by the Markov Random Field (MRF) based image segmentation, we propose a new framework of 3D m...
متن کامل