David Eppstein
and David Hart

*Proc. 5th Worksh. Algorithms and Data Structures (WADS 1997)*, Lecture Notes in Computer Science 1272, Frank K. H. A. Dehne,
Andrew Rau-Chaplin,
Jörg-Rudiger Sack,
and Roberto Tamassia, ed., Springer-Verlag, Aug 1997, pp. 234–247

Cited by:

- Finding an optimal path without growing the tree
- Approximating the shortest path in line arrangements
- Computing shortest paths with comparisons and additions
- Topological peeling and applications
- Topological peeling and implementation
- Shortest paths in two intersecting pencils of lines
- On shortest paths in line arrangements
- Algorithms for Geometric Shortest Paths Along Routes