Balanced Aspect Ratio Trees: Combining t
✍
Christian A. Duncan; Michael T. Goodrich; Stephen Kobourov
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 273 KB
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