3D Mesh Segmentation Methodologies for CAD applications

Agathos, Alexander; Pratikakis, Ioannis; Perantonis, Stavros; Sapidis, Nickolas S.; Azariadis, Philip

doi:10.1080/16864360.2007.10738515

Cited by 146 publications

(77 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Many mesh segmentation methods exist in the graphics literature that aim to decompose a mesh into functional parts; a recent survey can be found in [28] and [1], and comparisons between several algorithms appear in [3]. These b) Consistent Segmentation a) Individual Segmentations Figure 1: Individual segmentations of a set of chairs are shown in (a).…”

Section: Previous Workmentioning

confidence: 99%

Consistent segmentation of 3D models

Golovinskiy

Funkhouser

2009

Computers & Graphics

175

149

View full text Add to dashboard Cite

This paper proposes a method to segment a set of models consistently. The method simultaneously segments models and creates correspondences between segments. First, a graph is constructed whose nodes represent the faces of every mesh, and whose edges connect adjacent faces within a mesh and corresponding faces in different meshes. Second, a consistent segmentation is created by clustering this graph, allowing for outlier segments that are not present in every mesh. The method is demonstrated for several classes of objects and used for two applications: symmetric segmentation and segmentation transfer.

show abstract

Section: Previous Workmentioning

confidence: 99%

Consistent segmentation of 3D models

Golovinskiy

Funkhouser

2009

Computers & Graphics

175

149

View full text Add to dashboard Cite

show abstract

“…Many shape decomposition techniques have been developed in computer graphics literature (see [31] and [32] for thorough surveys); most of these are for partitioning a single surface following its own geometry. Here, for the mapping purpose, the partitioning of and M need to be consistent (i.e., each subpart i has same topology with its corresponding part M i , and the dual graphs of these two decompositions are isomorphic).…”

Section: Positional Constraints By Surface Mappingmentioning

confidence: 99%

Biharmonic Volumetric Mapping Using Fundamental Solutions

et al. 2013

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-We propose a biharmonic model for cross-object volumetric mapping. This new computational model aims to facilitate the mapping of solid models with complicated geometry or heterogeneous inner structures. In order to solve cross-shape mapping between such models through divide and conquer, solid models can be decomposed into subparts upon which mappings is computed individually. The biharmonic volumetric mapping can be performed in each subregion separately. Unlike the widely used harmonic mapping which only allows C 0 continuity along the segmentation boundary interfaces, this biharmonic model can provide C 1 smoothness. We demonstrate the efficacy of our mapping framework on various geometric models with complex geometry (which are decomposed into subparts with simpler and solvable geometry) or heterogeneous interior structures (whose different material layers can be segmented and processed separately).

show abstract

“…In recent years, we have seen an explosive growth of the available 3D model data across a variety of fields, such as reverse engineering and 3D medical imaging, with the development of the acquisition techniques [1,23,20,16,15,8,7,5,10,18]. We are therefore faced with an ever-increasing demand for approaches towards automatic model processing, understanding and analysis.…”

Section: Introductionmentioning

confidence: 99%