메뉴 건너뛰기




Volumn 23, Issue 2, 1999, Pages 203-210

Analysis of cache sensitive representation for binary space partitioning trees

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; PROBLEM SOLVING;

EID: 0032688483     PISSN: 03505596     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (13)

References (11)
  • 5
    • 0019033556 scopus 로고
    • On Visible Surface Generation by A Priori Tree Structures
    • July
    • Fuchs, H., Kedem, M.Z., Naylor, B. On Visible Surface Generation by A Priori Tree Structures, Proceedings of SIGGRAPH'80, Vol. 14, No. 3, July, pp. 124-133, 1980.
    • (1980) Proceedings of SIGGRAPH'80 , vol.14 , Issue.3 , pp. 124-133
    • Fuchs, H.1    Kedem, M.Z.2    Naylor, B.3
  • 6
    • 13044263587 scopus 로고    scopus 로고
    • Cache Sensitive Representation for BSP trees
    • International conference on Computer Graphics, Portugal, December 15-18
    • Havran, V., Cache Sensitive Representation for BSP trees, Compugraphics '97, International conference on Computer Graphics, Portugal, December 15-18, pp. 369-376, 1997.
    • (1997) Compugraphics '97 , pp. 369-376
    • Havran, V.1
  • 7
    • 13044273332 scopus 로고
    • AlphaSort: A Cache-Sensitive Parallel External Sort
    • Nyberg, C., Barclay, T., Cvetanovic, Z., Gray, J., Lomet D.B. AlphaSort: A Cache-Sensitive Parallel External Sort, VLDB Journal, Vol. 4, No. 4, pp.603-627, 1995.
    • (1995) VLDB Journal , vol.4 , Issue.4 , pp. 603-627
    • Nyberg, C.1    Barclay, T.2    Cvetanovic, Z.3    Gray, J.4    Lomet, D.B.5
  • 9
    • 13044305019 scopus 로고    scopus 로고
    • Silicon Graphics Power Challenge
    • Silicon Graphics Power Challenge, Technical Report, 1996.
    • (1996) Technical Report


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