id: 04201703
dt: j
an: 04201703
au: Mulmuley, Ketan
ti: On levels in arrangements and Voronoi diagrams.
so: Discrete Comput. Geom. 6, No.4, 307-338 (1991).
py: 1991
pu: Springer-Verlag, New York, NY
la: EN
cc: 
ut: arrangement of hyperplanes; Voronoi diagrams
ci: 
li: doi:10.1007/BF02574692
ab: The author introduces a powerful technique of so-called $θ$ 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.
rv: M.Křivánek (Praha)