DocumentCode
1839552
Title
Geodesic paths on triangular meshes
Author
Martínez, Dimas ; Velho, Luiz ; Carvalho, Paulo Cezar
Author_Institution
Inst. Nacional de Matematica Pura e Aplicada, Rio de Janeiro, Brazil
fYear
2004
fDate
17-20 Oct. 2004
Firstpage
210
Lastpage
217
Abstract
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian´s (1996) fast marching method and Polthier´s (1998) straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and nonconvex surfaces as well.
Keywords
computational geometry; data visualisation; differential geometry; iterative methods; convex surfaces; discrete geodesic approximation; fast marching method; geodesic paths; iterative process; nonconvex surfaces; straightest geodesics theory; triangular meshes; triangulated surface; Computational geometry; Data structures; Geophysics computing; Iterative algorithms; Iterative methods; Motion planning; Navigation; Robot motion; Shortest path problem; Solid modeling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Graphics and Image Processing, 2004. Proceedings. 17th Brazilian Symposium on
ISSN
1530-1834
Print_ISBN
0-7695-2227-0
Type
conf
DOI
10.1109/SIBGRA.2004.1352963
Filename
1352963
Link To Document