On parallel rectilinear obstacle-avoiding paths

DOI10.1016/0925-7721(93)90004-PMaRDI QIDQ1314529zbMATH OpenOpenAlexFDO

Authors Mikhail J. Atallah, Danny Z. Chen

Publication date 29 November 1994

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0925-7721(93)90004-p

zbMATH Keywords

data structureconvex polygonrecursion treespace complexityCREW PRAMquery processingpartitioning schemeprocessor complexityobstacle-avoiding paths

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
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane

Cites work

• scientific article; zbMATH DE number 432842 (Why is no real title available?)
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Efficient Parallel Algorithms for String Editing and Related Problems
• ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
• On the X-Y convex hull of a set of X-Y polygons
• Parallel Merge Sort
• Parallel rectilinear shortest paths with rectangular obstacles
• Rectilinear shortest paths in the presence of rectangular barriers
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(9)

• Rectilinear short path queries among rectangular obstacles
• ON GEOMETRIC PATH QUERY PROBLEMS
• ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
• Applications of a numbering scheme for polygonal obstacles in the plane
• Parallel rectilinear shortest paths with rectangular obstacles
• Parallel algorithms for the segment dragging problem
• ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
• Planar rectilinear shortest path computation using corridors

This page was built for publication: On parallel rectilinear obstacle-avoiding paths

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