Geodesic Remeshing Using Front Propagation - Archive ouverte HAL Access content directly
Journal Articles International Journal of Computer Vision Year : 2006

Geodesic Remeshing Using Front Propagation


In this paper, we propose a complete framework for 3D geometry modeling and processing that uses only fast geodesic computations. The basic building block for these techniques is a novel greedy algorithm to perform a uniform or adaptive remeshing of a triangulated surface. Our other contributions include a parameterization scheme based on barycentric coordinates, an intrinsic algorithm for computing geodesic centroidal tessellations, and a fast and robust method to flatten a genus-0 surface patch. On large meshes (more than 500,000 vertices), our techniques speed up computation by over one order of magnitude in comparison to classical remeshing and parameterization methods. Our methods are easy to implement and do not need multilevel solvers to handle complex models that may contain poorly shaped triangles.
Fichier principal
Vignette du fichier
06-IJCV-PeyreCohen-GeodesicRemeshing.pdf (8.14 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00359719 , version 1 (09-02-2009)


  • HAL Id : hal-00359719 , version 1


Gabriel Peyré, Laurent D. Cohen. Geodesic Remeshing Using Front Propagation. International Journal of Computer Vision, 2006, 69 (1), pp.145-156. ⟨hal-00359719⟩
185 View
1678 Download


Gmail Facebook X LinkedIn More