Abstract
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 or almost equal efficiency as on ordinaryk-d trees. Both two- and multidimensional dividedk-d trees are studied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A. V., J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
Bentley, J. L., Multidimensional binary search trees used for associated searching,Comm. A CM,18 (1975), 509–517.
Bentley, J. L., Multidimensional binary search trees in database applications.IEEE Trans. Software Engrg.,5 (1979), 333–340.
Bentley, J. L., Decomposable searching problems.Inform. Process. Lett.,8 (1979), 244–251.
Finkel, R. A., and J. L. Bentley, Quad-trees; a data structure for retrieval on composite keys,Acta Inform.,4 (1974), 1–9.
Kersten, M. L., and P. van Emde Boas, Local optimizations of quad-trees, Technical Report IR-52, Free University Amsterdam, 1979.
Knuth, D. E.,The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, Mass., 1973.
van Kreveld, M. J., and M. H. Overmars, Concatenable structures for decomposable problems, Technical Report RUU-CS-89-16, Utrecht University, 1989.
Lueker, G. S., A data structure for orthogonal range queries.Proc. 19th IEEE Symp. on Foundations of Computer Science, 1978, pp. 28–34.
Overmars, M. H.,The Design of Dynamic Data Structures, Lecture Notes in Computer Science, Vol. 156, Springer-Verlag, Berlin, 1983.
Overmars, M. H., and J. van Leeuwen, Worst-case optimal insertion and deletion methods for decomposable searching problems.Inform. Process. Lett.,12 (1981), 168–173.
Overmars, M. H., and J. van Leeuwen, Dynamic multi-dimensional data structures based on quad- andk-d trees,Acta Inform.,17 (1982), 267–285.
Preparata, F. P., and M. I. Shamos,Computational Geometry, An Introduction, Springer-Verlag, New York, 1985.
Samet, H., Deletion in two-dimensional quad-trees,Comm. ACM,23 (1980), 703–710.
Samet, H., Bibliography on quad-trees and related hierarchical data structures, in: L. Kessenaar, F. Peters, and M. van Lierop (Eds.),Data Structures for Raster Graphics, Springer-Verlag, Berlin, 1986, pp. 181–201.
Willard, D. E.,Predicate-Oriented Database Search Algorithms, Garland, New York, 1979.
Willard, D. E., and G. S. Lueker, Adding range restriction capability to dynamic data structures,J. Assoc. Comput. Mach.,32 (1985), 597–617.
Author information
Authors and Affiliations
Additional information
Communicated by David Dobkin.
Rights and permissions
About this article
Cite this article
van Kreveld, M.J., Overmars, M.H. Dividedk-d trees. Algorithmica 6, 840–858 (1991). https://doi.org/10.1007/BF01759075
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01759075