Geodesic Remeshing Using Front Propagation - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

Geodesic Remeshing Using Front Propagation


In this paper, we present a method for remeshing triangulated manifolds by using geodesic path calculations and distance maps. Our work builds on the Fast Marching algorithm, which has been extended to arbitrary meshes by Sethian and Kimmel. First, a set of points that are evenly spaced across the surface is automatically found. A geodesic Delaunay triangulation of the set of points is then created, using a Voronoi diagram construction based on Fast Marching. At last, we use the distance information to find a simple parameterization of the manifold. Marching algorithm makes this method computationally inexpensive, and gives very good results. Examples are shown for synthetic and real surfaces.
Fichier principal
Vignette du fichier
03-VLSM-PeyreCohen-GeodesicRemeshing.pdf (811.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : hal-00365627 , version 1


Gabriel Peyré, Laurent D. Cohen. Geodesic Remeshing Using Front Propagation. VLSM'03, Sep 2003, Nice, France. pp.33-40. ⟨hal-00365627⟩
373 View
167 Download


Gmail Facebook X LinkedIn More