gislecture5spatial_简版创新.pptVIP

Constructing a kd-tree Since there are many possible ways to choose axis-aligned splitting planes, there are many different ways to construct kd-trees. The canonical method of kd-tree construction has the following constraints: As one moves down the tree, one cycles through the axes used to select the splitting planes. (For example, the root would have an x-aligned plane, the roots children would both have y-aligned planes, the roots grandchildren would all have z-aligned planes, and so on.) At each step, the point selected to create the splitting plane is the median of the points being put into the kd-tree, with respect to their coordinates in the axis being used. This method leads to a balanced kd-tree, in which each leaf node is about the same distance from the root. However, balanced trees are not necessarily optimal for all applications. Adding elements to a kd-tree One adds a new point to a kd-tree in the same way as one adds an element to any other tree. First, traverse the tree, starting from the root and moving to either the left or the right child depending on whether the point to be inserted is on the left or right side of the splitting plane. Once you get to a leaf node, add the new point as either the left or right child of the leaf node, again depending on which side of the nodes splitting plane contains the new point. [edit] Removing elements from a kd-tree Remove a point from an existing kd-tree, without breaking the invariant. (Undone) [edit] Balancing a kd-tree Balancing a kd-tree requires care. Because kd-trees are sorted in multiple dimensions, the tree rotation technique cannot be used to balance them — this may break the invariant. The R-tree A multi-dimensional generalization of the B-tree A height-balanced tree Having received a great deal of attention due to its well defined structure Like the B-tree, node splitting and merging are required R-trees are tree data structures that are similar to B-trees, but are used for spatial access meth