| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10336967 | Computers & Graphics | 2005 | 9 Pages |
Abstract
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on 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 both convex and non-convex surfaces.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Dimas MartÃnez, Luiz Velho, Paulo C. Carvalho,