ON THE COMPLEXITY OF D-DIMENSIONAL VORONOI DIAGRAMS

被引：64

作者：

KLEE, V

机构：

来源：

关键词：

D O I：

10.1007/BF01224932

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：75 / 80

页数：6

共 13 条

[1]

Carathe<prime>odory C., 1911, REND CIRC MAT PALERM, V32, P193, DOI [10.1007/BF03014795, DOI 10.1007/BF03014795]

[2]

Davis C., 1959, SCRIPTA MATH, V24, P219

[3]

Eggleston H.G., 1964, COMMENT MATH HELV, V39

[4]

GALE D, 1963, AM MATH SOC P S PURE, V7, P225

[5]

Grunbaum B, 1967, CONVEX POLYTOPES

[6] POLYTOPE PAIRS AND THEIR RELATIONSHIP TO LINEAR-PROGRAMMING [J].

KLEE, V .

[7] MAXIMUM NUMBERS OF FACES OF A CONVEX POLYTOPE [J].

MCMULLEN, P .

[8]

PREPARATA FP, 1977, STEPS COMPUTATIONAL, P23

[9]

REISS SP, 69 YAL U COMP SCI DE

[10]

Scott R. F., 1879, MESSENG MATH, V8, P155