Geometric k th Shortest Paths ∗

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A near-optimal algorithm for shortest paths among curved obstacles in the plane

  2013cited by this paper
• On the Complexity of Higher Order Abstract Voronoi Diagrams

  2013cited by this paper
• L_1 Shortest Path Queries among Polygonal Obstacles in the Plane

  2013cited by this paper
• Computing Shortest Paths amid Convex Pseudodisks

  2013cited by this paper
• Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes

  2013cited by this paper
• On Higher Order Voronoi Diagrams of Line Segments

  2012cited by this paper
• Finding the K Shortest Loopless Paths in a Network

  2007cited by this paper
• Finding the k shortest simple paths

  2007cited by this paper
• Testing Homotopy for Paths in the Plane

  2002cited by this paper
• Geometric Shortest Paths and Network Optimization

  2000cited by this paper
• Handbook of Computational Geometry

  2000cited by this paper
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane

  1999cited by this paper
• Topologically sweeping visibility complexes via pseudotriangulations

  1996cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Tree-weighted neighbors and geometric k smallest spanning trees

  1994cited by this paper
• Finding the k shortest paths

  1994cited by this paper
• Finding thek smallest spanning trees

  1990cited by this paper
• On k-Nearest Neighbor Voronoi Diagrams in the Plane

  1982cited by this paper

• Shortest Paths Among Obstacles in the Plane Revisited

  2020cites this paper
• Geometric kth Shortest Paths: the Applet

  2014influential citation