Parallel rectilinear shortest paths with rectangular obstacles
DOI10.1016/0925-7721(91)90002-VzbMATH Open0764.68167OpenAlexW1975595599MaRDI QIDQ1190293FDOQ1190293
Authors: 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
Recommendations
- On parallel rectilinear obstacle-avoiding paths
- Efficient approximate shortest-path queries among isothetic rectangular obstacles
- Rectilinear short path queries among rectangular obstacles
- Shortest paths in the plane with convex polygonal obstacles
- Rectilinear shortest paths in the presence of rectangular barriers
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Parallel Prefix Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- Efficient Parallel Algorithms for String Editing and Related Problems
- An Efficient Parallel Biconnectivity Algorithm
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Finding level-ancestors in trees
- Parallel Merge Sort
- Euclidean shortest paths in the presence of rectilinear barriers
- Title not available (Why is that?)
- The Discrete Geodesic Problem
- On Shortest Paths in Polyhedral Spaces
- Finding minimum rectilinear distance paths in the presence of barriers
- The Parallel Evaluation of General Arithmetic Expressions
- On Some Distance Problems in Fixed Orientations
- On the X-Y convex hull of a set of X-Y polygons
- Title not available (Why is that?)
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Rectilinear shortest paths in the presence of rectangular barriers
- Parallel algorithms for shortest path problems in polygons
- Title not available (Why is that?)
Cited In (12)
- Computing the all-pairs longest chains in the plane
- On parallel rectilinear obstacle-avoiding paths
- Rectilinear short path queries among rectangular obstacles
- ON GEOMETRIC PATH QUERY PROBLEMS
- Applications of a numbering scheme for polygonal obstacles in the plane
- Title not available (Why is that?)
- Rectilinear paths among rectilinear obstacles
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Optimal parallel algorithms for rectilinear link-distance problems
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- A multifacility location problem on median spaces
- Efficient approximate shortest-path queries among isothetic rectangular obstacles
This page was built for publication: Parallel rectilinear shortest paths with rectangular obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190293)
