On the complexity ofd- dimensional Voronoi diagrams
- 1 December 1980
- journal article
- Published by Springer Nature in Archiv der Mathematik
- Vol. 34 (1), 75-80
- https://doi.org/10.1007/bf01224932
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Computational GeometryPublished by Springer Nature ,1985
- The complexity of linear programmingTheoretical Computer Science, 1980
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Polytope pairs and their relationship to linear programmingActa Mathematica, 1974
- The maximum numbers of faces of a convex polytopeMathematika, 1970
- Packing and Covering. By C. A. Rogers. Pp. viii, 111. 30s. 1964. (Cambridge)The Mathematical Gazette, 1966
- Some semicontinuity theorems for convex polytopes and cell-complexesCommentarii Mathematici Helvetici, 1964
- Neighborly and cyclic polytopesProceedings of Symposia in Pure Mathematics, 1963
- Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionenRendiconti del Circolo Matematico di Palermo Series 2, 1911