On parallel computation of Voronoï diagrams

The paper presents an O(log3 n) algorithm for constructing the Voronoi diagrams of a set of n points on a shared memory parallel computer, where concurrent reads are allowed but no two processors can simultaneously attempt to write into the same memory location. If concurrent writes are allowed, the algorithm would run in O(log2n) time.