메뉴 건너뛰기




Volumn 4443 LNCS, Issue , 2007, Pages 876-883

Visible nearest neighbor queries

Author keywords

Nearest neighbor; Spatial algorithms; Spatial data structures

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

EID: 38049105583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71703-4_73     Document Type: Conference Paper
Times cited : (45)

References (9)
  • 1
    • 0038673236 scopus 로고    scopus 로고
    • Handbook of Computation Geometry. Elsevier Science Publishers, Amsterdam, The Netherlands
    • T. Asano, S. K. Ghosh, and T. C. Shermer. Visibility in the plane, pages 829-876. Handbook of Computation Geometry. Elsevier Science Publishers, Amsterdam, The Netherlands, 2000.
    • (2000) Visibility in the plane , pp. 829-876
    • Asano, T.1    Ghosh, S.K.2    Shermer, T.C.3
  • 2
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • Atlantic City, NJ, USA, ACM Press
    • N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD Conf., pages 322-331, Atlantic City, NJ, USA, 1990. ACM Press.
    • (1990) Proceedings of the ACM SIGMOD Conf , pp. 322-331
    • Beckmann, N.1    Kriegel, H.2    Schneider, R.3    Seeger, B.4
  • 3
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J. L. Bentley. Multidimensional binary search trees used for associative searching. CACM, 18(9):509-517, 1975.
    • (1975) CACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 5
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Boston, MA, USA, ACM Press
    • A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conf, pages 47-57, Boston, MA, USA, 1984. ACM Press.
    • (1984) Proceedings of the ACM SIGMOD Conf , pp. 47-57
    • Guttman, A.1
  • 6
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2):265-318, 1999.
    • (1999) ACM Trans. Database Syst , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 7
    • 33749592385 scopus 로고    scopus 로고
    • Nearest surrounder queries
    • Atlanta, GA, USA, IEEE Computer Society
    • K. C. K. Lee, W. C. Lee, and H. V. Leong. Nearest surrounder queries. In Proceedings of the ICDE Conf., pages 85-94, Atlanta, GA, USA, 2006. IEEE Computer Society.
    • (2006) Proceedings of the ICDE Conf , pp. 85-94
    • Lee, K.C.K.1    Lee, W.C.2    Leong, H.V.3
  • 9
    • 0021644214 scopus 로고
    • The quadtree and related hierarchical data structures
    • H. Samet. The quadtree and related hierarchical data structures. ACM Comput. Surv., 16(2): 187-260, 1984.
    • (1984) ACM Comput. Surv , vol.16 , Issue.2 , pp. 187-260
    • Samet, H.1


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