Higher-dimensional voronoi diagrams in linear expected time
A general method is presented for determining the mathematical expectation of the combinatorial complexity and other properties of the Voronoi diagram ofn independent and identically distributed points. The method is applied to derive exact asymptotic bounds on the expected number of vertices of the Voronoi diagram of points chosen from the uniform distribution on the interior of ad-dimensional ball; it is shown that in this case, the complexity of the diagram is ∵(n) for fixedd. An algorithm for constructing the Voronoid diagram is presented and analyzed. The algorithm is shown to require only ∵(n) time on average for random points from ad-ball assuming a real-RAM model of computation with a constant-time floor function. This algorithm is asymptotically faster than any previously known and optimal in the average-case sense.
Unable to display preview. Download preview PDF.
- 2.D. Avis and B. K. Bhattacharya, Algorithms for computingd-dimensional Voronoi diagrams and their duals, inAdvances in Computing Research: Computational Geometry, F. P. Preparata, ed., pp. 159–180, JAI Press, Greenwich, CT, 1983.Google Scholar
- 4.W. H. Beyer,CRC Standard Mathematical Tables, 27th ed., CRC Press, Boca Raton, FL, 1984.Google Scholar
- 5.B. Bhattacharya, Worst-case Analysis of a Convex Hull Algorithm, Technical Report, Simon Fraser University, 1982.Google Scholar
- 7.K. Q. Brown, Geometric Transforms for Fast Geometric Algorithms, Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA, 1979.Google Scholar
- 20.R. E. Miles, A synopsis of “Poisson flats in Euclidean spaces”, inStochastic Geometry, E. F. Harding and D. G. Kendall, eds., pp. 202–227, Wiley, New York, 1974.Google Scholar
- 24.R. Seidel, The complexity of Voronoi diagrams in higher dimensions, inProc. 20th Ann. Allerton Conf. on Communication, Control, and Computing, pp. 94–95, University of Illinois at Urbana-Champaign, 1982.Google Scholar
- 25.R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, inProc. 18th ACM Symp. on Theory of Computing, pp. 404–413, ACM, 1986.Google Scholar
- 26.R. Seidel, On the number of faces in higher-dimensional Voronoi diagrams, inProc. 3rd Ann. Symp. on Computational Geometry, pp. 181–185, ACM, 1987.Google Scholar
- 31.F. G. Tricomi,Funzioni Ipergeometriche Confluente, Edizioni Cremonese, Rome, 1954.Google Scholar