33 citations · 37 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 1 cited
Building a Balanced k-d Tree with MapReduce
Russell A. Brown
The original description of the k-d tree recognized that rebalancing techniques, such as are used to build an AVL tree or a red-black tree, are not applicable to a k-d tree. Hence,…
cs.DS2014★ 33 cited
Building a Balanced k-d Tree in O(kn log n) Time
Russell A. Brown
The original description of the k-d tree recognized that rebalancing techniques, such as are used to build an AVL tree or a red-black tree, are not applicable to a k-d tree. Hence,…