Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures

Authors:
Roberto Tamassia;Jeffrey S Vitter
Affiliations:
-;-
Venue:
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures
Year:
1989

Citing 0
Cited 1

Selecting distances in the plane

SCG '90 Proceedings of the sixth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present parallel algorithms for several graph and geometric problems, including transitive closure and topological sorting in planar $st$-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal $O( log n)$ running time with $n / log n$ processors in the EREW PRAM model.