Parallel algorithms for shortest path problems in polygons
DOI10.1007/BF01901194zbMATH Open0646.68058OpenAlexW2052770190MaRDI QIDQ1104089FDOQ1104089
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
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
computational geometryparallel algorithmssimple polygonCREW RAM shared memory model of computationshortest- path tree
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Convex sets in (2) dimensions (including convex curves) (52A10)
Cites Work
- Title not available (Why is that?)
- An Efficient Parallel Biconnectivity Algorithm
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Euclidean shortest paths in the presence of rectilinear barriers
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Systolic Design for Connectivity Problems
Cited In (9)
- -Algorithms for Minimum Link Path and Related Problems
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- Accelerated parallel projection method for solving the shortest distance problem
- Parallel methods for visibility and shortest-path problems in simple polygons
- Title not available (Why is that?)
- PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
- Title not available (Why is that?)
- Parallel rectilinear shortest paths with rectangular obstacles
- Efficient piecewise-linear function approximation using the uniform metric
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)
