The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Multidimensional binary search trees used for associative searching
Communications of the ACM
General methods for parallel-searching.
General methods for parallel-searching.
Deletion in binary storage trees.
Deletion in binary storage trees.
A compendium of key search references
ACM SIGIR Forum
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Multikey retrieval from K-d trees and QUAD-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
SCG '85 Proceedings of the first annual symposium on Computational geometry
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
A scientific database system for polymers and materials engineering needs
SSDBM'1994 Proceedings of the 7th international conference on Scientific and Statistical Database Management
Application of DBMS to land information systems
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Randomized insertion and deletion in point quad trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 48.22 |
An algorithm for deletion in two-dimensional quad trees that handles the problem in a manner analogous to deletion in binary search trees is presented. The algorithm is compared with a proposed method for deletion which reinserts all of the nodes in the subtrees of the deleted node. The objective of the new algorithm is to reduce the number of nodes that need to be reinserted. Analysis for complete quad trees shows that the number of nodes requiring reinsertion is reduced to as low as 2/9 of that required by the old algorithm. Simulation tests verify this result. Reduction of the number of insertions has a similar effect on the number of comparison operations. In addition, the total path length (and balance) of the resulting tree is observed to remain constant or increase slightly when the new algorithm for deletion is used, whereas use of the old algorithm results in a significant increase in the total path length for large trees.