On levels in arrangements and Voronoi diagrams (Q804321)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On levels in arrangements and Voronoi diagrams |
scientific article; zbMATH DE number 4201703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On levels in arrangements and Voronoi diagrams |
scientific article; zbMATH DE number 4201703 |
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
0.856957733631134
0 references
0.8569576144218445
0 references
0.814196765422821
0 references
0.8048284649848938
0 references
0.8047077059745789
0 references
