On the number of faces in higher-dimensional Voronoi diagrams

Authors:
R. Seidel
Affiliations:
IBM Almaden Research Center, Computer Science Division, Univ. of California at Berkeley
Venue:
SCG '87 Proceedings of the third annual symposium on Computational geometry
Year:
1987

Higher-dimensional Voronoi diagrams in linear expected time

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Maximal empty ellipsoids

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques to enable dimensionality reduction for voronoi-based nearest neighbor search

EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
A new approach to output-sensitive voronoi diagrams and delaunay triangulations

Proceedings of the twenty-ninth annual symposium on Computational geometry

Hi-index	0.00

We give exact upper bounds for the number of i-dimensional faces of Euclidean furthest point Voronoi diagrams of n points in Rd.