Shortest paths among transient obstacles
From MaRDI portal
Publication:2156288
DOI10.1007/S10878-020-00604-1zbMATH Open1495.90227OpenAlexW3041287753MaRDI QIDQ2156288FDOQ2156288
Authors: Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
Publication date: 18 July 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00604-1
Recommendations
shortest pathtime discretizationshortest path mapcontinuous Dijkstratime minimal pathtransient obstacles
Cites Work
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Computational geometry. Algorithms and applications.
- Rectilinear paths among rectilinear obstacles
- Optimal Search in Planar Subdivisions
- Planning Algorithms
- Optimal Point Location in a Monotone Subdivision
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- On Some Distance Problems in Fixed Orientations
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Visibility of disjoint polygons
- Title not available (Why is that?)
- Rectilinear line segment intersection, layered segment trees, and dynamization
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- An optimal dynamic interval stabbing-MAX data structure?
- Title not available (Why is that?)
- Computing Shortest Paths in the Plane with Removable Obstacles
Cited In (4)
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)