Sciweavers

Share
VMV
2007

Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes

8 years 11 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky et al. [1]. While the original algorithm is able to compute geodesic distances to isolated points on the mesh only, our generalization can handle arbitrary, possibly open, polygons on the mesh to define the zero set of the distance field. Our extensions integrate naturally into the base algorithm and consequently maintain all its nice properties. For most geometry processing algorithms, the exact geodesic distance information is sampled at the mesh vertices and the resulting piecewise linear interpolant is used as an approximation to the true distance field. The quality of this approximation strongly depends on the structure of the mesh and the location of the medial axis of the distance field. Hence our second contribution is a simple adaptive refinement scheme, which inserts new vertices at critical loc...
David Bommes, Leif Kobbelt
Added 07 Nov 2010
Updated 07 Nov 2010
Type Conference
Year 2007
Where VMV
Authors David Bommes, Leif Kobbelt
Comments (0)
books