𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane

✍ Scribed by Rajasekaran; Ramaswami

Publisher
Springer
Year
2002
Tongue
English
Weight
214 KB
Volume
33
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A nearly optimal parallel algorithm for
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
✍ Piotr Berman; Andrzej Lingas πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 756 KB

We present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex polygon. The algorithm runs in time O(logn) and uses O(n loglogn/log n) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an O(log n)-time an