Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees

Christian A. Duncan, Michael T. Goodrich, Stephen Kobourov

Research output: Contribution to journalArticlepeer-review

35 Scopus citations


Given a set S of n points on ℝd, we show, for fixed d, how to construct in O(n log n) time a data structure we call the balanced aspect ratio (BAR) tree. A BAR tree is a binary space partition tree on S that has O(log n) depth in which every region is convex and "fat" (that is, has a bounded aspect ratio). While previous hierarchical data structures such as k-d trees, quadtrees, octrees, fair-split trees, and balanced box decompositions can guarantee some of these properties, we know of no previous data structure that combines all of these properties simultaneously. The BAR tree data structure has numerous applications ranging from geometric searching problems in fixed dimensional space to the visualization of graphs and three-dimensional worlds.

Original languageEnglish (US)
Pages (from-to)303-333
Number of pages31
JournalJournal of Algorithms
Issue number1
StatePublished - Jan 2001

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees'. Together they form a unique fingerprint.

Cite this