SCOPUS 정보 검색 플랫폼

Volumn 34, Issue 1, 1980, Pages 75-80

On the complexity of d- dimensional Voronoi diagrams

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003160635 PISSN: 0003889X EISSN: 14208938 Source Type: Journal
DOI: 10.1007/BF01224932 Document Type: Article

Times cited : (79)

References (13)

1
- 65749318481
- Über den Variabilitätsbereich der Fourier'schen Konstanten von positiven Harmonischen Funktionen
- (1911) Rend. Circ. Matem. Palermo , vol.32 , pp. 193-217
- Carathéodory, C.¹

2
- 0039581970
- The set of non-linearity of a convex piecewise-linear function
- (1959) Scripta Math. , vol.24 , pp. 219-228
- Davis, C.¹

3
- 51249193959
- Some semicontinuity theorems for convex polytopes and cell-complexes
- (1964) Comment. Math. Helv. , vol.39 , pp. 165-188
- Eggleston, H.G.¹ Grünbaum, B.² Klee, V.³

4
- 84931102558
- D. Gale, Neighborly and cyclic polytopes. Convexity (V. Klee, ed.). Amer. Math. Soc. Proc. Symp. Pure Math. 7, 225–232 (1963).

6
- 0039649391
- Polytope pairs and their relationship to linear programming
- (1974) Acta Math. , vol.133 , pp. 1-25
- Klee, V.¹

7
- 84976163829
- The maximum number of faces of a convex polytope
- (1970) Mathematika , vol.17 , pp. 179-184
- McMullen, P.¹

8
- 84931102556
- A nearest-point Voronoi polyhedron for n points may have (O(n²)) vertices. Steps onto Computational Geometry
- F. P., Preparata, Coordinated Science Lab., University of Illinois, Urbana
- (1977) Tech. Rep. , pp. 23-24
- Preparata, F.P.¹

9
- 84931102553
- S. P. Reiss and D. P. Dobkin, The complexity of linear programming. Tech. Rep. No. 69, Yale Univ. Comp. Sci. Dept.

10
- 84931102554
- C. A. Rogers, Packing and Covering. Cambridge Tracts in Math. and Math. Physics, No. 54, Cambridge 1964.

11
- 77951203216
- Note on a theorem of Prof. Cayley's
- (1879) Messenger Math. , vol.8 , pp. 155-157
- Scott, R.F.¹

12
- 84931102552
- M. I. Shamos, Computational Geometry. Ph. D. thesis, Yale Univ. Comp. Sci. Dept., 1975.

13
- 84931102551
- M. I. Shamos and D. Hoey, Closest-point problems. Proc. 16th Ann. IEEE Symp. Foundations Comp. Sci. 151–162 (1975).

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.