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

메뉴 건너뛰기

Computational Geometry: Theory and Applications

Volumn 17, Issue 3-4, 2000, Pages 135-152

Approximate range searching

(2) Arya, Sunil a Mount, David M b

a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY (Hong Kong)

b UNIVERSITY OF MARYLAND (United States)

Author keywords

Approximation algorithms; Box decomposition trees; Partition trees; Range searching

Indexed keywords

EID: 0001182625 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/S0925-7721(00)00022-5 Document Type: Article

Times cited : (108)

References (16)

1
- 0032201716
- An optimal algorithm for approximate nearest neighbor searching
- Arya S., Mount D.M., Netanyahu N.S., Silverman R., Wu A. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM. 45:1998;891-923.
- (1998) Journal of the ACM , vol.45 , pp. 891-923
- Arya, S.¹ Mount, D.M.² Netanyahu, N.S.³ Silverman, R.⁴ Wu, A.⁵

2
- 0025154701
- K-d trees for semidynamic point sets
- Bentley J.L. K-d trees for semidynamic point sets. Proc. 6th Ann. ACM Sympos. Comput. Geom. 1990;187-197.
- (1990) Proc. 6th Ann. ACM Sympos. Comput. Geom. , pp. 187-197
- Bentley, J.L.¹

3
- 0027540038
- Approximate closest-point queries in high dimensions
- Bern M. Approximate closest-point queries in high dimensions. Inform. Process. Lett. 45:1993;95-99.
- (1993) Inform. Process. Lett. , vol.45 , pp. 95-99
- Bern, M.¹

4
- 51249163483
- How hard is halfspace range searching
- Brönnimann H., Chazelle B., Pach J. How hard is halfspace range searching. Discrete Comput. Geom. 10:1993;143-155.
- (1993) Discrete Comput. Geom. , vol.10 , pp. 143-155
- Brönnimann, H.¹ Chazelle, B.² Pach, J.³

5
- 0029239056
- A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
- Callahan P.B., Kosaraju S.R. A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields. Journal of the ACM. 42:1995;67-90.
- (1995) Journal of the ACM , vol.42 , pp. 67-90
- Callahan, P.B.¹ Kosaraju, S.R.²

6
- 84968509410
- Lower bounds on the complexity of polytope range searching
- Chazelle B. Lower bounds on the complexity of polytope range searching. J. Amer. Math. Soc. 2:1989;637-666.
- (1989) J. Amer. Math. Soc. , vol.2 , pp. 637-666
- Chazelle, B.¹

7
- 0000690281
- Quasi-optimal range searching in spaces of finite VC-dimension
- Chazelle B., Welzl E. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4:1989;467-489.
- (1989) Discrete Comput. Geom. , vol.4 , pp. 467-489
- Chazelle, B.¹ Welzl, E.²

8
- 0020937087
- Fast algorithms for the all nearest neighbors problem
- Clarkson K.L. Fast algorithms for the all nearest neighbors problem. Proc. 24th Ann. IEEE Sympos. on the Found. Comput. Sci. 1983;226-232.
- (1983) Proc. 24th Ann. IEEE Sympos. on the Found. Comput. Sci. , pp. 226-232
- Clarkson, K.L.¹

9
- 0032777413
- Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
- Duncan C.A., Goodrich M.T., Kobourov S.G. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. Proc. 10th ACM-SIAM Sympos. Discrete Algorithms. 1999.
- (1999) Proc. 10th ACM-SIAM Sympos. Discrete Algorithms
- Duncan, C.A.¹ Goodrich, M.T.² Kobourov, S.G.³

10
- 0022056484
- Rate-distortion performance of DPCM schemes for autoregressive sources
- Farvardin N., Modestino J.W. Rate-distortion performance of DPCM schemes for autoregressive sources. IEEE Trans. Inform. Theory. 31:1985;402-418.
- (1985) IEEE Trans. Inform. Theory , vol.31 , pp. 402-418
- Farvardin, N.¹ Modestino, J.W.²

11
- 51249161633
- Range searching with efficient hierarchical cuttings
- Matousek J. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom. 10:(2):1993;157-182.
- (1993) Discrete Comput. Geom. , vol.10 , Issue.2 , pp. 157-182
- Matousek, J.¹

12
- 0000474079
- Point location in fat subdivisions
- Overmars M.H. Point location in fat subdivisions. Inform. Process. Lett. 44:1992;261-265.
- (1992) Inform. Process. Lett. , vol.44 , pp. 261-265
- Overmars, M.H.¹

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

14
- 85040889046
- Reading, MA: Addison-Wesley
- Samet H. The Design and Analysis of Spatial Data Structures. 1990;Addison-Wesley, Reading, MA.
- (1990) The Design and Analysis of Spatial Data Structures
- Samet, H.¹

15
- 0000662711
- An O(nlogn) algorithm for the all-nearest-neighbors problem
- Vaidya P.M. An O(nlogn) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom. 4:1989;101-115.
- (1989) Discrete Comput. Geom. , vol.4 , pp. 101-115
- Vaidya, P.M.¹

16
- 0000949343
- Polygon retrieval
- Willard D.E. Polygon retrieval. SIAM J. Comput. 11:1982;149-165.
- (1982) SIAM J. Comput. , vol.11 , pp. 149-165
- Willard, D.E.¹

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