A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane
From MaRDI portal
Publication:5097508
DOI10.1137/21M1428248MaRDI QIDQ5097508
Hakan Yildiz, J. E. Hershberger, Subhash Suri
Publication date: 25 August 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- An algorithm for shortest-path motion in three dimensions
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- Ray shooting in polygons using geodesic triangulations
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Bisector curves of planar rational curves.
- Topologically sweeping visibility complexes via pseudotriangulations
- The Discrete Geodesic Problem
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- Optimal Point Location in a Monotone Subdivision
- On Shortest Paths in Polyhedral Spaces
- On Shortest Paths Amidst Convex Polyhedra
- An O(n2) shortest path algorithm for a non-rotating convex body
- Optimal Search in Planar Subdivisions
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Shortest paths in the plane with polygonal obstacles
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Computing Shortest Paths among Curved Obstacles in the Plane
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
This page was built for publication: A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane
