메뉴 건너뛰기




Volumn 40, Issue 2, 2011, Pages 249-255

An efficient 3D R-tree extension method concerned with levels of detail

Author keywords

3D GIS; Levels of detail(LOD); R tree; Spatial index

Indexed keywords

ALGORITHM; GIS; NUMERICAL MODEL; THREE-DIMENSIONAL MODELING;

EID: 79956066240     PISSN: 10011595     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (21)

References (13)
  • 1
    • 79956086086 scopus 로고    scopus 로고
    • 08-20 2009-12-09
    • Open Geospatial Consortium. OpenGIS CityGML Encoding Standard [EB/OL]. 2008-08-20 [2009-12-09]. http://www.opengeospatial.org/standards/citygml.
    • (2008) OpenGIS CityGML Encoding Standard [EB/OL]
  • 2
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching [J]
    • GUTTMAN A. R-trees: A Dynamic Index Structure for Spatial Searching [J]. ACM SIGMOD Record, 1984, 14(2):47-54.
    • (1984) ACM SIGMOD Record , vol.14 , Issue.2 , pp. 47-54
    • Guttman, A.1
  • 3
    • 34447270534 scopus 로고    scopus 로고
    • An efficient 3D R-tree spatial index method for virtual geographic environments
    • DOI 10.1016/j.isprsjprs.2007.05.007, PII S0924271607000524
    • ZHU Q, GONG J, ZHANG Y. An Efficient 3D R-tree Spatial Index Method for Virtual Geographic Environments [J]. ISPRS Journal of Photogrammetry and Remote Sensing, 2007, 62(3):217-224. (Pubitemid 47043388)
    • (2007) ISPRS Journal of Photogrammetry and Remote Sensing , vol.62 , Issue.3 , pp. 217-224
    • Zhu, Q.1    Gong, J.2    Zhang, Y.3
  • 6
    • 0142049641 scopus 로고    scopus 로고
    • A mechanism of implementing visualization with level of detail at multi-scale [J]
    • LI Jun, JING Ning, SUN Maoyin. A Mechanism of Implementing Visualization with Level of Detail at Multi-scale [J]. Journal of Software, 2002, 13(10):2037-2043.
    • (2002) Journal of Software , vol.13 , Issue.10 , pp. 2037-2043
    • Li, J.1    Jing, N.2    Sun, M.3
  • 7
    • 0025447750 scopus 로고
    • The R *-tree: An efficient and robust access method for points and rectangles [C]
    • New York: ACM
    • BECHMANN N, KRIEGEL H P, SCHNEIDER R, et al. The R *-tree: An Efficient and Robust Access Method for Points and Rectangles [C]//Proceedings ACM SIGMOD Conference. New York: ACM, 1990:322-331.
    • (1990) Proceedings ACM SIGMOD Conference , pp. 322-331
    • Bechmann, N.1    Kriegel, H.P.2    Schneider, R.3
  • 8
    • 36249029312 scopus 로고    scopus 로고
    • A brand-new node-choosing algorithm in R-tree spatial index [C]
    • Bellingham: SPIE
    • GONG J, KE S, BAO S. A Brand-new Node-choosing Algorithm in R-tree Spatial Index [C]//Proceedings of SPIE. Bellingham: SPIE, 2007:1-10.
    • (2007) Proceedings of SPIE , pp. 1-10
    • Gong, J.1    Ke, S.2    Bao, S.3
  • 9
    • 79851493209 scopus 로고    scopus 로고
    • Research on spatial index structure of LOD-OR tree in 3D GIS [J]
    • ZHENG Kun. LIU Xiuguo, YANG Hui. Research on Spatial Index Structure of LOD-OR Tree in 3D GIS [J]. Bulletin of Surveying and Mapping, 2005, (5):72-74.
    • (2005) Bulletin of Surveying and Mapping , Issue.5 , pp. 72-74
    • Zheng, K.1    Liu, X.2    Yang, H.3
  • 12
    • 17244370064 scopus 로고    scopus 로고
    • The evolvement and progress of R-tree family [J]
    • ZHANG Mingbo, LU Feng, SHEN Paiwei, et al. The Evolvement and Progress of R-tree Family [J]. Chinese Journal of Computers, 2005, 28(3):289-230.
    • (2005) Chinese Journal of Computers , vol.28 , Issue.3 , pp. 289-230
    • Zhang, M.1    Lu, F.2    Shen, P.3


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