Parallel rectilinear shortest paths with rectangular obstacles
From MaRDI portal
Publication:1190293
DOI10.1016/0925-7721(91)90002-VzbMath0764.68167OpenAlexW1975595599MaRDI QIDQ1190293
Mikhail J. Atallah, Danny Z. Chen
Publication date: 27 September 1992
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(91)90002-v
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items
Rectilinear short path queries among rectangular obstacles ⋮ Computing the all-pairs longest chains in the plane ⋮ A multifacility location problem on median spaces ⋮ ON GEOMETRIC PATH QUERY PROBLEMS ⋮ Rectilinear paths among rectilinear obstacles ⋮ On parallel rectilinear obstacle-avoiding paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the X-Y convex hull of a set of X-Y polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Parallel algorithms for shortest path problems in polygons
- Rectilinear shortest paths in the presence of rectangular barriers
- Finding level-ancestors in trees
- On Some Distance Problems in Fixed Orientations
- The Discrete Geodesic Problem
- Euclidean shortest paths in the presence of rectilinear barriers
- Efficient Parallel Algorithms for String Editing and Related Problems
- An Efficient Parallel Biconnectivity Algorithm
- On Shortest Paths in Polyhedral Spaces
- Parallel Merge Sort
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- Finding minimum rectilinear distance paths in the presence of barriers
- The Parallel Evaluation of General Arithmetic Expressions
This page was built for publication: Parallel rectilinear shortest paths with rectangular obstacles
