AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
From MaRDI portal
Publication:4889507
DOI10.1142/S0218195996000149zbMath0854.68023MaRDI QIDQ4889507
Publication date: 12 August 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)
Related Items
Minimum-link shortest paths for polygons amidst rectilinear obstacles ⋮ Linear-size planar Manhattan network for convex point sets ⋮ Computing a maxian point of a simple rectilinear polygon ⋮ Geometric path problems with violations ⋮ Finding rectilinear least cost paths in the presence of convex polygonal congested regions ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ \(L_{1}\) shortest path queries in simple polygons ⋮ Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane ⋮ An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
