메뉴 건너뛰기




Volumn , Issue , 2005, Pages 535-544

Space-time tradeoffs for approximate spherical range counting

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE VORONOI DIAGRAMS (AVD); QUERY TIME; SPACE-TIME TRADEOFFS; SPHERICAL RANGE COUNTING;

EID: 20744446135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (21)

References (17)
  • 5
    • 0032201716 scopus 로고    scopus 로고
    • An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
    • S. Arya, D. M. Mount, N. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM, 45:891-923, 1998.
    • (1998) J. ACM , vol.45 , pp. 891-923
    • Arya, S.1    Mount, D.M.2    Netanyahu, N.3    Silverman, R.4    Wu, A.Y.5
  • 7
    • 0029239056 scopus 로고
    • A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
    • P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
    • (1995) J. ACM , vol.42 , pp. 67-90
    • Callahan, P.B.1    Kosaraju, S.R.2
  • 8
    • 84968509410 scopus 로고
    • Lower bounds on the complexity of polytope range searching
    • B. Chazelle. Lower bounds on the complexity of polytope range searching. J. Amer. Math. Soc., 2:637-666, 1989.
    • (1989) J. Amer. Math. Soc. , vol.2 , pp. 637-666
    • Chazelle, B.1
  • 10
    • 0021467937 scopus 로고
    • Storing a sparse table with O(1) worst case access time
    • M. L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
    • (1984) J. ACM , vol.31 , Issue.3 , pp. 538-544
    • Fredman, M.L.1    Komlos, J.2    Szemeredi, E.3
  • 13
    • 0001472827 scopus 로고    scopus 로고
    • On some geometric optimization problems in layered manufacturing
    • J. Majhi, R. Janardan, M. Smid, and P. Gupta. On some geometric optimization problems in layered manufacturing. Comput. Geom. Theory Appl., 12:219-239, 1999.
    • (1999) Comput. Geom. Theory Appl. , vol.12 , pp. 219-239
    • Majhi, J.1    Janardan, R.2    Smid, M.3    Gupta, P.4
  • 14
    • 51249161633 scopus 로고
    • Range searching with efficient hierarchical cuttings
    • J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
    • (1993) Discrete Comput. Geom. , vol.10 , Issue.2 , pp. 157-182
    • Matoušek, J.1
  • 15
    • 0034417244 scopus 로고    scopus 로고
    • On approximate geometric k-clustering
    • J. Matoušek. On approximate geometric k-clustering. Discrete and Comput. Geometry, 24:61-84, 2000.
    • (2000) Discrete and Comput. Geometry , vol.24 , pp. 61-84
    • Matoušek, J.1
  • 16


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