kd-trees introduced by J.L. Bentley, range trees, divided kd-trees etc. belong to a class of kd-tree variants for pointer machine model. However, Bkd-tree is a RAM model based kdtree, and recent papers on both models are
a. Pointer machine model
www.madalgo.au.dk/~larsen/papers/4ddom.pdf
b. RAM Model
www.madalgo.au.dk/~larsen/papers/orth_revisit.pdf
For comparisons, can kd-trees and its variants falling under pointer machine model of computation be combined with RAM model based kd trees?