Shortest paths in an arrangement with $k$ line orientations

David Eppstein and David Hart
Proc. 10th Symp. Discrete Algorithms, ACM and SIAM, Jan 1999, pp. 310–316

Cited by:

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