SHORTEST PATH QUERIES IN RECTILINEAR WORLDS

DOI10.1142/S0218195992000172MaRDI QIDQ4030352zbMATH OpenFDO

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)

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)

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

Cited in

(12)

• Shortest path to a segment and quickest visibility queries
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• Is it FPT to cover points with tours on minimum number of bends (errata)?
• Querying Approximate Shortest Paths in Anisotropic Regions
• An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
• Rectilinear path problems in restricted memory setup
• 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)