A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Optimal parallel algorithms for rectilinear link-distance problems
1995
Algorithmica
We provide optimal parallel solutions to several link distance problems set in trapezoided rectilinear polygons. All our main parallel algorithms are deterministic and designed to run on the exclusive read exclusive write parallel random-access machine (EREW PRAM). Let P be a trapezoided rectilinear simple polygon with n vertices. In O(log n) time using O(n=log n) processors we can optimally compute 1. minimum rectilinear link paths, or shortest paths in the L 1 metric from any point in P to
doi:10.1007/bf01206332
fatcat:kal5bv4mazbiddaizbg2b5lmju