Abstract
We describe an n-processor, O (log(n) log log(n))-time CRCW algorithm to construct the Voronoi diagram for a set of n point-sites in the plane.
Original language | English (US) |
---|---|
Pages (from-to) | 569-617 |
Number of pages | 49 |
Journal | Algorithmica (New York) |
Volume | 16 |
Issue number | 6 |
DOIs | |
State | Published - Dec 1996 |
Keywords
- Parallel algorithm
- Voronoi diagram
ASJC Scopus subject areas
- General Computer Science
- Computer Science Applications
- Applied Mathematics