Parallel rectilinear shortest paths with rectangular obstacles

DOI10.1016/0925-7721(91)90002-VMaRDI QIDQ1190293zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

CREW-PRAMshortest rectilinear obstacle-avoiding paths

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 4064475 (Why is no real title available?)
• scientific article; zbMATH DE number 30300 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• An Efficient Parallel Biconnectivity Algorithm
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Efficient Parallel Algorithms for String Editing and Related Problems
• Euclidean shortest paths in the presence of rectilinear barriers
• Finding level-ancestors in trees
• Finding minimum rectilinear distance paths in the presence of barriers
• Finding the maximum, merging, and sorting in a parallel computation model
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On Shortest Paths in Polyhedral Spaces
• On Some Distance Problems in Fixed Orientations
• On the X-Y convex hull of a set of X-Y polygons
• Parallel Merge Sort
• Parallel Prefix Computation
• Parallel algorithms for shortest path problems in polygons
• Rectilinear shortest paths in the presence of rectangular barriers
• The Discrete Geodesic Problem
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(14)

• Efficient approximate shortest-path queries among isothetic rectangular obstacles
• Applications of a numbering scheme for polygonal obstacles in the plane
• Shortest rectilinear path queries to rectangles in a rectangular domain
• A multifacility location problem on median spaces
• On parallel rectilinear obstacle-avoiding paths
• Rectilinear paths among rectilinear obstacles
• SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
• Rectilinear short path queries among rectangular obstacles
• ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
• Rectilinear path problems in restricted memory setup
• Computing the all-pairs longest chains in the plane
• ON GEOMETRIC PATH QUERY PROBLEMS
• scientific article; zbMATH DE number 3845073 (Why is no real title available?)
• Optimal parallel algorithms for rectilinear link-distance problems

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)