Parallel algorithms for shortest path problems in polygons

DOI10.1007/BF01901194zbMath0646.68058OpenAlexW2052770190MaRDI QIDQ1104089

Hossam ElGindy, Michael T. Goodrich

Publication date: 1988

Published in: The Visual Computer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01901194

zbMATH Keywords

parallel algorithmscomputational geometrysimple polygonCREW RAM shared memory model of computationshortest- path tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (4)

Efficient piecewise-linear function approximation using the uniform metric ⋮ Parallel rectilinear shortest paths with rectangular obstacles ⋮ Parallel methods for visibility and shortest-path problems in simple polygons ⋮ Determining Weak Visibility of a Polygon from an Edge in Parallel

Cites Work

• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A Systolic Design for Connectivity Problems
• Euclidean shortest paths in the presence of rectilinear barriers
• An Efficient Parallel Biconnectivity Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel algorithms for shortest path problems in polygons