SHORTEST PATH QUERIES IN RECTILINEAR WORLDS

DOI10.1142/S0218195992000172zbMath0762.68028MaRDI QIDQ4030352

Bengt J. Nilsson, Marc J. van Kreveld, Mark T. de Berg, 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)

Related Items (6)

A multifacility location problem on median spaces ⋮ Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? ⋮ Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions ⋮ Rectilinear paths among rectilinear obstacles

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