On parallel computation of Voronoi diagrams (Q1123595)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On parallel computation of Voronoi diagrams |
scientific article |
Statements
On parallel computation of Voronoi diagrams (English)
0 references
1989
0 references
We present an \(O(\log^ 3n)\) 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 attempts to write into the same memory location. If concurrent writes are allowed, the algorithm would run in \(O(\log^ 2n)\) time.
0 references
parallel algorithms
0 references
Voronoi diagrams
0 references
shared memory parallel computer
0 references