Fast exact and approximate geodesics on meshes
ACM SIGGRAPH 2005 Papers
Efficiently determining a locally exact shortest path on polyhedral surfaces
Computer-Aided Design
Reconstructing multiresolution mesh for web visualization based on PDE resampling
Transactions on computational science XII
A framework for working with digitized cultural heritage artifacts
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
| Hi-index | 0.00 |
We present a new algorithm to compute a geodesic path over a triangulated surface. Based in Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and non-convex surfaces as well.