On levels in arrangements and Voronoi diagrams (Q804321): Difference between revisions

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.