A near-optimal algorithm for shortest paths among curved obstacles in the plane
From MaRDI portal
Publication:5097508
Recommendations
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Approximation algorithms for curvature-constrained shortest paths
- Shortest curves in planar regions with curved boundary
- scientific article; zbMATH DE number 871939
Cites work
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- An algorithm for shortest-path motion in three dimensions
- An O(n2) shortest path algorithm for a non-rotating convex body
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Approximate Euclidean shortest paths amid convex obstacles
- Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
- Bisector curves of planar rational curves.
- Computing shortest paths amid pseudodisks
- Computing shortest paths among curved obstacles in the plane
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- scientific article; zbMATH DE number 4211552 (Why is no real title available?)
- scientific article; zbMATH DE number 696776 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 1182917 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On Shortest Paths Amidst Convex Polyhedra
- On Shortest Paths in Polyhedral Spaces
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Ray shooting in polygons using geodesic triangulations
- SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
- Shortest paths in the plane with polygonal obstacles
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- The Discrete Geodesic Problem
- Topologically sweeping visibility complexes via pseudotriangulations
Cited in
(9)- Shortest curves in planar regions with curved boundary
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- scientific article; zbMATH DE number 4216992 (Why is no real title available?)
- Computing shortest paths among curved obstacles in the plane
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
- Computing shortest paths amid non-overlapping weighted disks
- Exact solutions to the weighted region problem
This page was built for publication: A near-optimal algorithm for shortest paths among curved obstacles in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097508)
