메뉴 건너뛰기




Volumn , Issue , 2003, Pages 557-568

HDoV-tree: The structure, the storage, the speed

Author keywords

[No Author keywords available]

Indexed keywords

HDOV-TREE; STORAGE STRUCTURE; VISIBILITY QUERIES;

EID: 0344927767     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2003.1260821     Document Type: Conference Paper
Times cited : (19)

References (13)
  • 3
    • 84885607862 scopus 로고    scopus 로고
    • New linear node splitting algorithm for r-trees
    • Berlin, Germany
    • C. H. Ang and T. C. Tan. New linear node splitting algorithm for r-trees. In Advances in Spatial Databases, SSD'97, pages 339-349, Berlin, Germany, 1997.
    • (1997) Advances in Spatial Databases, SSD'97 , pp. 339-349
    • Ang, C.H.1    Tan, T.C.2
  • 6
    • 0030720201 scopus 로고    scopus 로고
    • Surface simplification using quadric error metrics
    • M. Garland and P. Heckbert. Surface simplification using quadric error metrics. In Proceedings of ACM SIGGRAPH 97, pages 209-216, 1997.
    • (1997) Proceedings of ACM SIGGRAPH 97 , pp. 209-216
    • Garland, M.1    Heckbert, P.2
  • 10
    • 0346207415 scopus 로고    scopus 로고
    • The visibility octree: A data structure for 3D navigation
    • C. Saona-Vázquez, I. Navazo, and P. Brunet. The visibility octree: A data structure for 3D navigation. Computers & Graphics, 23:635-643, 1999.
    • (1999) Computers & Graphics , vol.23 , pp. 635-643
    • Saona-Vázquez, C.1    Navazo, I.2    Brunet, P.3
  • 11
    • 0344379430 scopus 로고    scopus 로고
    • Querying large virtual models for interactive walkthrough
    • PhD thesis, National University of Singapore
    • L. Shou. Querying large virtual models for interactive walkthrough. PhD thesis, National University of Singapore, 2002.
    • (2002)
    • Shou, L.1


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