Shortest paths among transient obstacles

DOI10.1007/s10878-020-00604-1zbMath1495.90227OpenAlexW3041287753MaRDI QIDQ2156288

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

zbMATH Keywords

shortest pathtime discretizationshortest path mapcontinuous Dijkstratime minimal pathtransient obstacles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Path planning in a weighted planar subdivision under the Manhattan metric

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Visibility of disjoint polygons
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• Rectilinear paths among rectilinear obstacles
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
• On Some Distance Problems in Fixed Orientations
• Optimal Point Location in a Monotone Subdivision
• Rectilinear line segment intersection, layered segment trees, and dynamization
• Optimal Search in Planar Subdivisions
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Rectilinear Path Problems among Rectilinear Obstacles Revisited
• Computing Shortest Paths in the Plane with Removable Obstacles
• Planning Algorithms

This page was built for publication: Shortest paths among transient obstacles