Summary
Quad-trees and k—d trees have been noted for their lack of dynamic properties as data structures for multi-dimensional point sets. We describe a method to insert points in a quad-tree while keeping the tree balanced that achieves an average time complexity of O(log2 N) per insertion, where N is the number of updates performed on the quad-tree. We define a structure similar to a quad-tree, called a pseudo quad-tree, and show how it can be used to handle both insertions and deletions in O(log2 N) average time. We also discuss how quad-trees and pseudo quadtrees can be extended for use in configurations of points in which more than one point may have a same value in some equal coordinate, without altering the earlier time bounds for insertions, deletions and queries. Similar algorithms are given for k—d trees and the same average time bounds for insertion and deletion are achieved.
Similar content being viewed by others
References
Bentley, J.L.: Multidimensional binary search trees used for associated searching. C.ACM 18, 509–517 (1975)
Bentley, J.L.: Multidimensional binary search trees in database applications. IEEE Trans. Software Engrg., Se-5, 333–340 (1979)
Bentley, J.L., Stanat, D.F.: Analysis of range searches in quad-trees. Information Processing Lett. 3, 170–173 (1975)
Finkel, R.A., Bentley, J.L.: Quad-trees; a data structure for retrieval on composite keys. Acta Informat. 4, 1–9 (1974)
Kersten, M.L., van Emde Boas, P.: Local optimizations of quad-trees. Informatica Rapport IR-51, Amsterdam: Vrije Universiteit 1979
Lueker, G.S.: A data structure for orthogonal range queries. Proc. 19th IEEE Symp. Found. Comput. Sci. pp. 28–34 (1978)
Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23, 166–204 (1981)
Overmars, M.H., van Leeuwen, J.: Two general methods for dynamizing decomposable searching problems. Computing 26, 155–166 (1981)
Samet, H.: Deletion in two dimensional quad trees. C.ACM 23, 703–710 (1980)
Willard, D.E.: Balanced forests of k—d * trees as a dynamic data structure. Cambridge: The Aiken Computation Lab., (TR-23-78), Harvard University, USA, 1978
Willard, D.E.: The super-B-tree algorithm. Cambridge: The Aiken Computation Lab., (TR-03-79), Harvard University, USA, 1979
Author information
Authors and Affiliations
Additional information
The work of this author was partially supported by the Netherlands Organization for the Advancement of Pure Research (ZWO).
Rights and permissions
About this article
Cite this article
Overmars, M.H., van Leeuwen, J. Dynamic multi-dimensional data structures based on quad- and k—d trees. Acta Informatica 17, 267–285 (1982). https://doi.org/10.1007/BF00264354
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264354