SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete & Computational Geometry

Volumn 4, Issue 1, 1989, Pages 101-115

An O(n log n) algorithm for the all-nearest-neighbors Problem

(1) Vaidya, Pravin M a

a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000662711 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02187718 Document Type: Article

Times cited : (198)

References (11)

1
- 84936548957
- M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th Annual ACM Symp. Theory Comput., 1983, pp. 80–86.

2
- 0018999905
- Multidimensional divide-and-conquer
- (1980) Comm. ACM , vol.23 , pp. 214-229
- Bentley, J.L.¹

3
- 0011703962
- The complexity of finding fixed radius nearest neighbors
- (1977) Inform. Process. Lett. , vol.6 , pp. 209-212
- Bentley, J.L.¹ Stanat, D.F.² Willia, E.H.³

4
- 84976672179
- Optimal expected-time algorithms for closest-point problems
- (1982) ACM Tran. Math. Software , vol.6 , pp. 563-579
- Bentley, J.L.¹ Weide, B.² Yao, A.Y.³

5
- 84936548979
- K. Clarkson, Fast algorithms for the all-nearest-neighbors problem, Proc. 24th Annual Symp. Found. Comput. Sci., 1983, pp. 226–232.

6
- 84936548978
- H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems, Proc. 16th Annual ACM Symp. Theory Comput., 1984, pp. 135–143.

7
- 0003487647
- Springer-Verlag, New York
- (1985) Computational Geometry: An Introduction
- Preparata, F.P.¹ Shamos, M.I.²

8
- 0004225698
- Prentice Hall, Englewood Cliffs, NJ
- (1977) Combinatorial Algorithms: Theory and Practice
- Reingold, E.M.¹ Nievergelt, J.² Deo, N.³

9
- 0004229086
- Yale University, New Haven, CT
- (1978) Computational Geometry
- Shamos, M.I.¹

10
- 0002188930
- Probabilistic algorithms
- J. F., Traub, Academic Press, New York
- (1976) Algorithms and Complexity , pp. 21-30
- Rabin, M.O.¹

11
- 0040068855
- Finding nearest neighbors
- (1975) Inform. Process. Lett. , vol.3 , pp. 113-114
- Yuval, F.¹

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