loading...
Geodesic Paths on Triangular Meshes
Curitiba, PR, Brazil October 17-October 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SIBGRA.2004.1352963Computer Graphics and Image Processin ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dimas Mart?nez, IMPA-Instituto Nacional de Matem?tica Pura e Aplicada, Brasil
Luiz Velho, IMPA-Instituto Nacional de Matem?tica Pura e Aplicada, Brasil
Paulo Cezar Carvalho, IMPA-Instituto Nacional de Matem?tica Pura e Aplicada, Brasil
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.
Citation:
Dimas Mart?nez, Luiz Velho, Paulo Cezar Carvalho, "Geodesic Paths on Triangular Meshes," sibgrapi, pp.210-217, Computer Graphics and Image Processing, XVII Brazilian Symposium on (SIBGRAPI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.