ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES

DOI10.1142/S0218195994000021zbMath0805.68126MaRDI QIDQ4292525

Hossam ElGindy, Pinaki Mitra

Publication date: 26 January 1995

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

zbMATH Keywords

shortest pathparallel algorithmscomputational geometryCREW PRAMshortest route query

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Related Items (8)

Planar rectilinear shortest path computation using corridors ⋮ Rectilinear short path queries among rectangular obstacles ⋮ Efficient approximate shortest-path queries among isothetic rectangular obstacles ⋮ Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ Unnamed Item ⋮ Rectilinear paths among rectilinear obstacles ⋮ Computing an \(L_1\) shortest path among splinegonal obstacles in the plane ⋮ On parallel rectilinear obstacle-avoiding paths

This page was built for publication: ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES