Geodesic Methods for Shape and Surface Processing - Archive ouverte HAL Access content directly
Book Sections Year : 2009

Geodesic Methods for Shape and Surface Processing


This paper reviews both the theory and practice of the numerical computation of geodesic distances on Riemannian manifolds. The notion of Riemannian manifold allows to define a local metric (a symmetric positive tensor field) that encodes the information about the problem one wishes to solve. This takes into account a local isotropic cost (whether some point should be avoided or not) and a local anisotropy (which direction should be preferred). Using this local tensor field, the geodesic distance is used to solve many problems of practical interest such as segmentation using geodesic balls and Voronoi regions, sampling points at regular geodesic distance or meshing a domain with geodesic Delaunay triangles. The shortest path for this Riemannian distance, the so-called geodesics, are also important because they follow salient curvilinear structures in the domain. We show several applications of the numerical computation of geodesic distances and shortest paths to problems in surface and shape processing, in particular segmentation, sampling, meshing and comparison of shapes.
Fichier principal
Vignette du fichier
08-Book-PeyreCohen-GeodesicReview.pdf (6.33 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00365899 , version 1 (04-03-2009)



Gabriel Peyré, Laurent D. Cohen. Geodesic Methods for Shape and Surface Processing. Tavares, João Manuel R.S.; Jorge, R.M. Natal. Advances in Computational Vision and Medical Image Processing: Methods and Applications, Springer Verlag, pp.29-56, 2009, Computational Methods in Applied Sciences, Vol. 13, ⟨10.1007/978-1-4020-9086-8⟩. ⟨hal-00365899⟩
274 View
548 Download



Gmail Facebook X LinkedIn More