Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 300-309

  Duncan, Christian A ^a   Goodrich, Michael T ^a   Kobourov, Stephen ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SET THEORY; TREES (MATHEMATICS);

BALANCED ASPECT RATIO (BAR) TREES;

DATA STRUCTURES;

EID: 0032777413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)