Geodesic Paths On 3D Surfaces: Survey and Open Problems
arXiv:0904.2550 · doi:10.1016/j.comgeo.2011.05.006
Abstract
This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.
Cited by in corpus (9)
- Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
- A Survey of Algorithms for Geodesic Paths and Distances
- Differentiable Geodesic Distance for Intrinsic Minimization on Triangle Meshes
- Deep Geodesic Learning for Segmentation and Anatomical Landmarking
- DecoSurf: Recursive Geodesic Patterns on Triangle Meshes
- Toward Precise Curve Offsetting Constrained to Parametric Surfaces
- An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron
- Finding Geodesics on Surfaces Using Taylor Expansion of Exponential Map
- Efficient Exact Enumeration of Single-Source Geodesics on a Non-Convex Polyhedron