Computing geodesics on triangular meshes

13 years 4 months ago

Download www.visgraf.impa.br

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. Key words: shortest geodesic, manifold triangulation, curve evolution

Dimas Martínez Morera, Luiz Velho, Paulo Ce

Real-time Traffic

CG 2005 | Computer Graphics | Discrete Geodesic Approximation | Geodesic | Geodesic Path |

claim paper

» Approximations of Geodesic Distances for Incomplete Triangular Manifolds

» Realtime multiagent path planning on arbitrary surfaces

» A Novel Volumetric Shape from Silhouette Algorithm Based on a Centripetal Pentahedron Mode...

» A Novel Method for 3D Surface Mesh Segmentation

» Construction of IsoContours Bisectors and Voronoi Diagrams on Triangulated Surfaces

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

» Fitting smooth surfaces to scattered 3D data using piecewise quadratic approximation

» Geodesicbased Surface Remeshing

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	CG
Authors	Dimas Martínez Morera, Luiz Velho, Paulo Cezar Pinto Carvalho

Comments (0)

Sciweavers

Computing geodesics on triangular meshes

CG 2005 | Computer Graphics | Discrete Geodesic Approximation | Geodesic | Geodesic Path |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers