A survey of geodesic paths on 3D surfaces

Authors:
Prosenjit Bose;Anil Maheshwari;Chang Shu;Stefanie Wuhrer
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6;School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6;National Research Council of Canada, Ottawa, Ontario, Canada K1A 0R6;National Research Council of Canada, Ottawa, Ontario, Canada K1A 0R6
Venue:
Computational Geometry: Theory and Applications
Year:
2011

Citing 41
Cited 3

On shortest paths in polyhedral spaces

SIAM Journal on Computing
Shortest-path motion

Proc. of the sixth conference on Foundations of software technology and theoretical computer science
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
The discrete geodesic problem

SIAM Journal on Computing
Fast algorithms for shortest paths in planar graphs, with applications

SIAM Journal on Computing
Path planning in 0/1/ weighted regions with applications

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
Approximating shortest paths on a convex polytope in three dimensions

Proceedings of the twelfth annual symposium on Computational geometry
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating weighted shortest paths on polyhedral surfaces

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating shortest paths on a convex polytope in three dimensions

Journal of the ACM (JACM)
Efficient computation of geodesic shortest paths

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Constructing Approximate Shortest Path Maps in Three Dimensions

SIAM Journal on Computing
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Fast Marching Methods

SIAM Review
Approximation algorithms for geometric shortest path problems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computational geometry column 35

ACM SIGACT News
Approximating Shortest Paths on a Nonconvex Polyhedron

SIAM Journal on Computing
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces

SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Shortest Paths on Polyhedral Surfaces

STACS '85 Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science
CNOP - A Package for Constrained Network Optimization

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Shortest path problems on polyhedral surfaces

Shortest path problems on polyhedral surfaces
Parallel implementation of geometric shortest path algorithms

Parallel Computing - Special issue: High performance computing with geographical data
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon

Theoretical Computer Science - Algebraic and numerical algorithm
Determining approximate shortest paths on weighted polyhedral surfaces

Journal of the ACM (JACM)
Three-Dimensional Face Recognition

International Journal of Computer Vision
Fast exact and approximate geodesics on meshes

ACM SIGGRAPH 2005 Papers
Minimal discrete curves and surfaces

Minimal discrete curves and surfaces
Efficient Computation of Isometry-Invariant Distances Between Surfaces

SIAM Journal on Scientific Computing
Shortest paths on realistic polyhedra

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Efficiently determining a locally exact shortest path on polyhedral surfaces

Computer-Aided Design
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

Discrete & Computational Geometry
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications
New lower bound techniques for robot motion planning problems

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Approximate Shortest Paths in Anisotropic Regions

SIAM Journal on Computing
Parallel algorithms for approximation of distance maps on parametric surfaces

ACM Transactions on Graphics (TOG)
Improving Chen and Han's algorithm on the discrete geodesic problem

ACM Transactions on Graphics (TOG)
Computing geodesics on triangular meshes

Computers and Graphics
On finding approximate optimal paths in weighted regions

Journal of Algorithms
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

Discrete & Computational Geometry
On bending invariant signatures for surfaces

IEEE Transactions on Pattern Analysis and Machine Intelligence

Approximating generalized distance functions on weighted triangulated surfaces with applications

Journal of Computational and Applied Mathematics
Probabilistic implications

Fuzzy Sets and Systems
Approximating geodesic distances on 2-manifolds in R3

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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 three-dimensional polyhedral surfaces. The goal of this survey is to identify the most relevant open problems, both theoretical and practical.