Parallel algorithms for shortest path problems in polygons

DOI10.1007/BF01901194MaRDI QIDQ1104089zbMATHOpenAlexFDO

Authors 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

computational geometryparallel algorithmssimple 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)

Recommendations

• Parallel methods for visibility and shortest-path problems in simple polygons
• Efficient parallel algorithms for shortest paths in planar graphs
• Optimal parallel algorithms for point-set and polygon problems
• scientific article; zbMATH DE number 1522928
• scientific article; zbMATH DE number 56471
• Efficient parallel algorithms for shortest paths in planar digraphs
• An addendum to parallel methods for visibility and shortest-path problems in simple polygons
• Parallel algorithms for geometric graph problems
• A parallel shortest path algorithm

Cites work

• scientific article; zbMATH DE number 3905859 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3759279 (Why is no real title available?)
• A Systolic Design for Connectivity Problems
• An Efficient Parallel Biconnectivity Algorithm
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Euclidean shortest paths in the presence of rectilinear barriers
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Cited in

(9)

• scientific article; zbMATH DE number 278832 (Why is no real title available?)
• Efficient piecewise-linear function approximation using the uniform metric
• Accelerated parallel projection method for solving the shortest distance problem
• Parallel methods for visibility and shortest-path problems in simple polygons
• -Algorithms for Minimum Link Path and Related Problems
• Parallel rectilinear shortest paths with rectangular obstacles
• scientific article; zbMATH DE number 1522928 (Why is no real title available?)
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS

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

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