Dividedk-d trees


A variant ofk-d trees, thedivided k-d tree, is described that has some important advantages over ordinaryk-d trees. The dividedk-d tree is fully dynamic and allows for the insertion and deletion of points inO(logn) worst-case time. Moreover, dividedk-d trees allow for split and concatenate operations. Different types of queries can be performed with equal… (More)
DOI: 10.1007/BF01759075


4 Figures and Tables

Cite this paper

@article{Kreveld1991DividedkdT, title={Dividedk-d trees}, author={Marc J. van Kreveld and Mark H. Overmars}, journal={Algorithmica}, year={1991}, volume={6}, pages={840-858} }