AI 中文总结
本文比较两种构建和修改动态k-d树的方法，一种是单个k-d树，另一种是由大小为2的递增整数幂的静态k-d树组成的动态树，描述了后者的插入和删除算法并比较二者性能。
AI 中文摘要
已经提出了两种构建和修改动态k-d树的方法。一种方法是将动态树存储为单个k-d树，并在由于k维元组插入树中或从树中删除元组而导致子树不平衡时，通过在树内重建子树来重新平衡该树。第二种方法是将动态树组成一组静态k-d树，其大小是2的递增整数幂；通过在插入或删除元组时在集合内重建静态树来维持该树的平衡。本文描述了第二种方法的插入和删除算法，并将第二种方法的性能与第一种方法的性能进行了比较。
英文摘要
Two methods have been proposed for building and modifying a dynamic k-d tree. One method stores the dynamic tree as a single k-d tree and rebalances that tree by rebuilding subtrees within the tree when those subtrees become unbalanced due to insertion of a k-dimensional tuple into the tree or deletion of a tuple from the tree. A second method composes a dynamic tree as a set of static k-d trees whose sizes are increasing integer powers of two; this tree's balance is maintained by rebuilding a static tree within the set upon insertion or deletion of a tuple. This article describes insertion and deletion algorithms for the second method, and compares the performance of the second method to the performance of the first method.
Comments14 pages, 6 figures
