• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Surface Segmentation Using Geodesic Centroidal Tesselation

Thumbnail
Date
2004-09
Link to item file
http://hal.archives-ouvertes.fr/hal-00365625/en/
Dewey
Probabilités et mathématiques appliquées
Sujet
Segmentation; surface; Voronoi; centred Voronoi diagram; Fast Marching; geodesic
Conference name
The second International Symposium on 3D Data Processing, Visualization, and Transmission
Conference date
09-2004
Conference city
Thessaloniki
Conference country
Grèce
Year
09-2004
Pages number
995-1002
URI
https://basepub.dauphine.fr/handle/123456789/444
Collections
  • CEREMADE : Publications
Metadata
Show full item record
Author
Peyré, Gabriel
Cohen, Laurent D.
Type
Communication / Conférence
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.