Balanced Aspect Ratio trees:: Combining the advantages of k-d trees and octrees

被引：0

作者：

Duncan, CA ^{[1
]}

Goodrich, MT ^{[1
]}

Kobourov, S ^{[1
]}

机构：

[1] Johns Hopkins Univ, Ctr Geometr Comp, Baltimore, MD 21218 USA

来源：

PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1999年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Given a set S of n points in R-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 and 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 solving several geometric searching problems in fixed dimensional space to aiding in the visualization of graphs and three-dimensional worlds.

引用

页码：300 / 309

页数：10

共 50 条

[21] Asymptotic distributions for partial match queries in K-d trees
Neininger, R
RANDOM STRUCTURES & ALGORITHMS, 2000, 17 (3-4) : 403 - 427
[22] Induction of linear decision trees with real-coded genetic algorithms and k-D trees
Ng, SC
Leung, KS
INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING IDEAL 2005, PROCEEDINGS, 2005, 3578 : 264 - 271
[23] Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
Chan, Timothy M.
DISCRETE & COMPUTATIONAL GEOMETRY, 2019, 61 (04) : 899 - 922
[24] DYNAMIC MULTIDIMENSIONAL DATA-STRUCTURES BASED ON QUAD-TREES AND K-D TREES
OVERMARS, MH
VANLEEUWEN, J
ACTA INFORMATICA, 1982, 17 (03) : 267 - 285
[25] Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
Timothy M. Chan
Discrete & Computational Geometry, 2019, 61 : 899 - 922
[26] On the Cost of Fixed Partial Match Queries in K-d Trees
Amalia Duch
Gustavo Lau
Conrado Martínez
Algorithmica, 2016, 75 : 684 - 723
[27] (k,d)-Balanced of Uniform k-Distant Trees
Murugan, M.
MATEMATIKA, 2013, 29 (01) : 65 - 71
[28] OPTIMAL BUCKET SIZE FOR NEAREST NEIGHBOR SEARCHING IN K-D TREES
EASTMAN, CM
INFORMATION PROCESSING LETTERS, 1981, 12 (04) : 165 - 167
[29] Traffic Sign Classification using K-d trees and Random Forests
Zaklouta, Fatin
Stanciulescu, Bogdan
Hamdoun, Omar
2011 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2011, : 2151 - 2155
[30] PARTIALLY SPECIFIED NEAREST NEIGHBOR SEARCHES USING K-D TREES
EASTMAN, CM
ZEMANKOVA, M
INFORMATION PROCESSING LETTERS, 1982, 15 (02) : 53 - 56

← 1 2 3 4 5 →