ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES

DOI10.1142/S0218195994000021MaRDI QIDQ4292525zbMATH OpenFDO

Authors Hossam ElGindy, Pinaki Mitra

Publication date 26 January 1995

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

Full work available at URL https://doi.org/10.1142/S0218195994000021

zbMATH Keywords

computational geometryCREW PRAMparallel algorithmsshortest pathshortest 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)

Recommendations

• Parallel rectilinear shortest paths with rectangular obstacles
• Rectilinear short path queries among rectangular obstacles
• Rectilinear shortest paths in the presence of rectangular barriers
• On parallel rectilinear obstacle-avoiding paths
• scientific article; zbMATH DE number 3845073

Cited in

(9)

• On parallel rectilinear obstacle-avoiding paths
• Rectilinear short path queries among rectangular obstacles
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
• Rectilinear paths among rectilinear obstacles
• Efficient approximate shortest-path queries among isothetic rectangular obstacles
• A divide-and-conquer algorithm for two-point L₁ shortest path queries in polygonal domains
• Shortest rectilinear path queries to rectangles in a rectangular domain
• Applications of a numbering scheme for polygonal obstacles in the plane
• Planar rectilinear shortest path computation using corridors

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

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