The Discrete Geodesic Problem

@article{Mitchell1987TheDG,
  title={The Discrete Geodesic Problem},
  author={Joseph S. B. Mitchell and David M. Mount and Christos H. Papadimitriou},
  journal={SIAM J. Comput.},
  year={1987},
  volume={16},
  pages={647-668}
}
We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n) and requires O(n2) space, where n is the number ofedges ofthe surface. Afterwe run our algorithm, the distance from the source to any other destination may be determined using standard techniques in… Expand

Paper Mentions

An Optimal Algorithm for Euclidean Shortest Paths in the Plane
TLDR
The algorithm is based on an efficient implementation of wavefront propagation among polygonal obstacles, and it actually computes a planar map encoding shortest paths from a fixed source point to all other points of the plane; the map can be used to answer single-source shortest path queries in O(log n) time. Expand
L1 shortest paths among polygonal obstacles in the plane
TLDR
By using bounds on the density of certain sparse binary matrices, it is shown thatE =O(n logn), implying that the algorithm for computing L1 shortest paths among polygonal obstacles in the plane is nearly optimal. Expand
Euclidean Shortest Paths on Polyhedra in Three Dimensions
TLDR
An optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions is presented, which settles a major problem that has been open for more than 20 years. Expand
Near optimal algorithm for the shortest descending path on the surface of a convex terrain
  • Sasanka Roy
  • Computer Science, Mathematics
  • J. Discrete Algorithms
  • 2012
TLDR
The algorithm improves both time and space complexity requirement of SDP problem by almost a linear factor over earlier best known results. Expand
Efficient computation of Euclidean shortest paths in the plane
  • J. Hershberger, S. Suri
  • Mathematics, Computer Science
  • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
TLDR
The algorithm actually computes a planar map that encodes shortest paths from a fixed source point to all other points of the plane; the map can be used to answer single-source shortest path queries in O(log n) time. Expand
A near-optimal algorithm for shortest paths among curved obstacles in the plane
TLDR
An algorithm is proposed that computes an approximate shortest path map, a data structure with O(n log n) size, that allows it to report the (approximate) length of a shortest path from a fixed source point to any query point in the plane in O(log n) time. Expand
Improving Chen and Han's algorithm on the discrete geodesic problem
TLDR
The experimental results suggest that the improved CH algorithm, in spite of an O(n2 log n) asymptotic time complexity, greatly outperforms the original CH algorithm in both time and space. Expand
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
TLDR
An optimal-time algorithm for computing the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions that constructs a dynamic version of Mount’s data structure that implicitly encodes the shortest paths from s to all other points of the surface. Expand
Determining approximate shortest paths on weighted polyhedral surfaces
TLDR
This algorithm is based on a novel way of discretizing polyhedral surfaces and utilizes a generic greedy approach for computing shortest paths in geometric graphs obtained by such discretization. Expand
Efficiently determining a locally exact shortest path on polyhedral surfaces
TLDR
An efficient visibility-based algorithm for determining a locally exact shortest path (LESP) from a source point to a destination point on a (triangulated) polyhedral surface and gives a LESP which is shorter than the initial path, at conclusion. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
Voronoi Diagrams on the Surface of a Polyhedron.
Abstract : This document presents an algorithm that computes the Voronol diagram of a set of point lying on the surface of a possibly nonconvex polyhedron. Distances are measured in the EuclideanExpand
Euclidean shortest paths in the presence of rectilinear barriers
TLDR
The goal is to find interesting cases for which the solution can be obtained without the explicit construction of the entire visibility graph, which solve the problems by constructing the shortest-path tree from the source to all the vertices of the obstacles and to the destination. Expand
On Finding Shortest Paths on Convex Polyhedra.
Abstract : Applications in robotics and autonomous navigation have motivated the study of motion planning and obstacle avoidance algorithms. The special case considered here is that of moving a pointExpand
On Shortest Paths in Polyhedral Spaces
TLDR
A favorable special case of the 3-D shortest path problem, namely that of finding the shortest path between two points along the surface of a convex polyhedron, is considered, which can be solved in time $O(n^3 \log n)$. Expand
Storing the subdivision of a polyhedral surface
  • D. Mount
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1987
TLDR
This work considers a natural generalization of a subdivision of a plane defined by the faces of a straight-line planar graph on a polyhedral surface and provides an efficient solution to the nearest-neighbor query problem on polyhedral surfaces. Expand
Shortest Paths on Polyhedral Surfaces
An algorithm is presented that finds the shortest path between two points on a polyhedral surface in O(n5) time, where n is the number of vertices on the surface, thereby establishing that theExpand
Shortest Paths in Euclidean Space with Polyhedral Obstacles.
Abstract : This document considers the problem of finding a minimum length path between two points in Euclidean space which avoids a set (not necessarily convex) polyhedral obstacles; we let n denoteExpand
A New Approach to Planar Point Location
  • F. Preparata
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1981
TLDR
This paper presents a practical algorithm which runs in less than $6\lceil {\log _2 n} \rceil $ comparisons on a data structure which uses O(n\log n) storage, in the worst case. Expand
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
  • Numerische Mathematik
  • 1959
TLDR
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given. Expand
Optimal Search in Planar Subdivisions
TLDR
This work presents a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage. Expand
...
1
2
...