Concepedia

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

Yevgeny Schreiber, Micha Sharir

Discrete & Computational Geometry · 2007 · 53 citations · 30 references

DOIFull text

Open access

Concepts

References

30

Optimal Search in Planar Subdivisions

David Kirkpatrick · SIAM Journal on Computing · 1983 · 751 citations

, , +13

The Discrete Geodesic Problem

Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou · SIAM Journal on Computing · 1987 · 722 citations

, , +15

A dichromatic framework for balanced trees

Leo J. Guibas, Robert Sedgewick · 1978 · 658 citations

, , +5

A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields

Paul B. Callahan, S. Rao Kosaraju · Journal of the ACM · 1995 · 555 citations · Full text

, , +8

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Leonidas Guibas, John Hershberger, Daniel Leven et al. · Algorithmica · 1987 · 508 citations

, , +16