Surface Segmentation Using Geodesic Centroidal Tesselation - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Surface Segmentation Using Geodesic Centroidal Tesselation


In this paper, we solve the problem of mesh partition using intrinsic computations on the 3D surface. The key concept is the notion of centroidal tesselation that is widely used in an eucidan settings. Using the Fast Marching algorithm, we are able to recast this powerful tool in the language of mesh processing. This method naturally fits into a framework for 3D geometry modelling and processing that uses only fast geodesic computations. With the use of classical geodesic-based building blocks, we are able to take into account any available information or requirement such as a 2D texture or the curvature of the surface.
Fichier principal
Vignette du fichier
04-3DPVT-PeyreCohen-SurfaceSegmentation.pdf (6.56 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00365625 , version 1 (03-03-2009)


  • HAL Id : hal-00365625 , version 1


Gabriel Peyré, Laurent D. Cohen. Surface Segmentation Using Geodesic Centroidal Tesselation. 3DPVT'04, Sep 2004, Tessaloniki, Greece. pp.995-1002. ⟨hal-00365625⟩
155 View
203 Download


Gmail Facebook X LinkedIn More