On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

Computational Geometry: Theory and Applications

Volumn 25, Issue 3, 2003, Pages 197-231

  Golin, Mordecai J ^a   Na, Hyeon Suk ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Average case analysis; Convex polytopes; Random points; Voronoi diagrams

Indexed keywords

EID: 84867942795     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00123-2     Document Type: Article

References (11)

1. D. Attali, J.-D. Boissonnat, Complexity of the Delaunay triangulation of points on a smooth surface, Preprint, January 2001
2. D. Attali, J.-D. Boissonnat, A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces, Submitted to Solid Modeling 2002. Also available at http://www.inria.fr/sophia/prisme/personnel/ boissonnat/
3. F. Aurenhammer Power diagrams: properties, algorithms and applications SIAM J. Computing 16 1987 78 96
4. J.L. Bentley, B.W. Weide, and A.C. Yao Optimal expected-time algorithms for closest point problems ACM Trans. on Mathematical Software 6 4 Dec. 1980 563 580
5. R. Dwyer Higher-dimensional Voronoi diagrams in linear expected time Discrete Comput. Geom. 6 4 1991 343 367
6. R. Dwyer The expected number of k-faces of a Voronoi diagram Computers Math. Applications 26 5 1993 13 19
7. H. Edelsbrunner Algorithms in Combinatorial Geometry 1987 Springer-Verlag Berlin
8. J. Erickson, Nice point sets can have nasty Delaunay triangulations, in: Proceedings of the 17th Annual ACM Symposium on Computational Geometry, 3-5 June 2001, pp. 96-105
9. G.R. Grimmett, and D.R. Stirzaker Probability and Random Processes 2nd Edition 1992 Clarendon Press Oxford
10. M. Golin, H.-S. Na, On the proofs of two lemmas describing the intersections of spheres with the boundary of a convex polytope, Hong Kong UST Theoretical Computer Science Center, Technical Report HKUST-TCSC-2001-09, July 2001. Available from http://www.cs.ust.hk/tcsc/RR
11. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer-Verlag New York