This is a preview of subscription content, log in via an institution to check access.
References
C. Carathéodory, Über den Variabilitätsbereich der Fourier'schen Konstanten von positiven Harmonischen Funktionen. Rend. Circ. Matem. Palermo32, 193–217 (1911).
C. Davis, The set of non-linearity of a convex piecewise-linear function. Scripta Math.24, 219–228 (1959).
H. G. Eggleston, B. Grünbaum andV. Klee, Some semicontinuity theorems for convex polytopes and cell-complexes. Comment. Math. Helv.39, 165–188 (1964).
D.Gale, Neighborly and cyclic polytopes. Convexity (V. Klee, ed.). Amer. Math. Soc. Proc. Symp. Pure Math.7, 225–232 (1963).
B.Grünbaum, Convex Polytopes. London 1967.
V. Klee, Polytope pairs and their relationship to linear programming. Acta Math.133, 1–25 (1974).
P. McMullen, The maximum number of faces of a convex polytope. Mathematika 17, 179–184 (1970).
F. P. Preparata, A nearest-point Voronoi polyhedron forn points may have (O(n 2)) vertices. Steps onto Computational Geometry (F. P. Preparata, ed.), Tech. Rep., Coordinated Science Lab., University of Illinois, Urbana, pp. 23–24 (1977).
S. P.Reiss and D. P.Dobkin, The complexity of linear programming. Tech. Rep. No. 69, Yale Univ. Comp. Sci. Dept.
C. A.Rogers, Packing and Covering. Cambridge Tracts in Math. and Math. Physics, No. 54, Cambridge 1964.
R. F. Scott, Note on a theorem of Prof. Cayley's. Messenger Math.8, 155–157 (1879).
M. I.Shamos, Computational Geometry. Ph. D. thesis, Yale Univ. Comp. Sci. Dept., 1975.
M. I.Shamos and D.Hoey, Closest-point problems. Proc. 16th Ann. IEEE Symp. Foundations Comp. Sci. 151–162 (1975).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Klee, V. On the complexity ofd- dimensional Voronoi diagrams. Arch. Math 34, 75–80 (1980). https://doi.org/10.1007/BF01224932
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01224932