SHORTEST PATH QUERIES IN RECTILINEAR WORLDS

DOI10.1142/S0218195992000172zbMATH Open0762.68028MaRDI QIDQ4030352FDOQ4030352

Authors: Bengt J. Nilsson, Mark de Berg, Marc Van Kreveld, Mark H. Overmars 

Publication date: 1 April 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 512835
• On rectilinear link distance
• AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
• Rectilinear short path queries among rectangular obstacles
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

zbMATH Keywords

shortest pathslab tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Cited In (12)

• Shortest path to a segment and quickest visibility queries
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
• Querying Approximate Shortest Paths in Anisotropic Regions
• Rectilinear path problems in restricted memory setup
• Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)?
• An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
• Shortest-path queries in static networks
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
• Rectilinear paths among rectilinear obstacles
• Shortest beer path queries in outerplanar graphs
• A multifacility location problem on median spaces

This page was built for publication: SHORTEST PATH QUERIES IN RECTILINEAR WORLDS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030352)