songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

add a set of definitions in the introduction

This commit is contained in:
Sébastien Loriot 2013-02-12 18:54:08 +01:00
parent 4a0e6b7707
commit 0b6cebeac1
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Surface_Mesh_Segmentation.txt
View File

@ -14,7 +14,6 @@ Elephant model with SDF values & Segmentation.
\section Surface_mesh_segmentationIntroduction Introduction
Mesh segmentation is the process of partitioning a mesh into smaller and meaningful sub-meshes. The application domain is wide and includes,
but is not limited to modeling, rigging, texturing, shape-retrieval, and deformation. See a detailed survey on mesh segmentation techniques \cite Shamir2008SegmentationSurvey for more details.
\todo put here the definition of segment vs. cluster
This package provides an implementation of the algorithm relying on the Shape Diameter Function \cite Shapira2008Consistent (SDF).
The SDF provides an estimate of the local volume diameter for each facet of the mesh (the SDF values). Given a surface mesh and its SDF values, the segmentation algorithm first applies soft clustering on
@ -29,6 +28,9 @@ and provide detailed results at the end of the manual.
\todo where is the benchmark result?
\note In this chapter, a segment refers to a connected component of facets of a mesh. A cluster is a set of facets, not necessarily connected.
One or several cluster can be merged to form a segment. Clustering refers to the action of gathering facets into the same segment or cluster.
\section Surface_mesh_segmentationOverviewoftheSegmentation Overview of the Segmentation Process
The segmentation algorithm consists of three major parts: Shape Diameter Function (SDF), soft clustering, and graph-cut for hard clustering.