A new algorithm for shortest paths among obstacles in the plane
From MaRDI portal
(Redirected from Publication:1356167)
Cites work
- A note on two problems in connexion with graphs
- An algorithmic approach to some problems in terrain navigation
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Euclidean shortest paths in the presence of rectilinear barriers
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On Shortest Paths in Polyhedral Spaces
- On the general motion-planning problem with two degrees of freedom
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal Point Location in a Monotone Subdivision
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- The Discrete Geodesic Problem
- Time and space efficient algorithms for shortest paths between convex polygons
- Visibility graphs and obstacle-avoiding shortest paths
- Visibility of disjoint polygons
Cited in
(12)- Routing in polygonal domains
- Routing in polygonal domains
- \(L_{1}\) cheapest paths in ``Fjord scenery
- Approximate Shortest Paths in Polygons with Violations
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- Quickest visibility queries in polygonal domains
- Time-minimal paths amidst moving obstacles in three dimensions
- Shortest paths in the plane with obstacle violations
- Rectilinear paths among rectilinear obstacles
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier
- Shortest paths in the plane with obstacle violations
This page was built for publication: A new algorithm for shortest paths among obstacles in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356167)
