Surface Segmentation Using Geodesic Centroidal Tesselation

Peyré, Gabriel; Cohen, Laurent D.

Peyré, Gabriel; Cohen, Laurent D. (2004-09), Surface Segmentation Using Geodesic Centroidal Tesselation, The second International Symposium on 3D Data Processing, Visualization, and Transmission, 2004-09, Thessaloniki, Grèce

Type

Communication / Conférence

External document link

http://hal.archives-ouvertes.fr/hal-00365625/en/

Date

2004-09

Conference title

The second International Symposium on 3D Data Processing, Visualization, and Transmission

Conference date

2004-09

Conference city

Thessaloniki

Conference country

Grèce

Number of pages

995-1002

Metadata

Show full item record

Author(s)

Peyré, Gabriel
Cohen, Laurent D.

Abstract (EN)

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.

Subjects / Keywords

Segmentation; surface; Voronoi; centred Voronoi diagram; Fast Marching; geodesic