Recommendations
Cites work
- scientific article; zbMATH DE number 871939 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- An optimal dynamic interval stabbing-MAX data structure?
- Computational geometry. Algorithms and applications.
- Computing shortest paths in the plane with removable obstacles
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- On Some Distance Problems in Fixed Orientations
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Planning Algorithms
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Rectilinear line segment intersection, layered segment trees, and dynamization
- Rectilinear paths among rectilinear obstacles
- Shortest paths in the plane with obstacle violations
- Visibility of disjoint polygons
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
Cited in
(5)- Path planning in a weighted planar subdivision under the Manhattan metric
- Rectilinear shortest paths among transient obstacles
- Fastest path across constrained moving rectilinear obstacles
- Estimation and determination of shortest path length in a road network with obstacles
- Shortest path in the presence of obstacles: An application to ocean shipping
This page was built for publication: Shortest paths among transient obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156288)
