On levels in arrangements and Voronoi diagrams (Q804321): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On levels in arrangements and Voronoi diagrams |
scientific article |
Statements
On levels in arrangements and Voronoi diagrams (English)
0 references
1991
0 references
The author introduces a powerful technique of so-called \(\theta\) series and probabilistic games which are suitable for the analysis of combinatorial and algorithmical complexity of randomized geometric algorithms. Fundamental results concerning the construction of levels in an arrangement of hyperplanes and higher-order Voronoi diagrams in any dimension are obtained. I enjoyed the underlying mathematical analysis.
0 references
arrangement of hyperplanes
0 references
Voronoi diagrams
0 references
