Uniform Grid quadtree kd tree bounding Volume Hierarchy R-Tree Search

Region Information Structure:
Uniform Grid

Wedge

Please try to dig in, this series of information structure is to understand what the problem is.

Uniform Grid

Well, it's checkers. Divide the whole world into equal squares.

The actual way is a two-dimensional array, the response to the checkered paper. Each grid is a list of the information that is contained in each of the squares.

The information can be anything, such as dots, lines, triangles.

If the information is based on more than one grid, then it can be stored in multiple squares at the same time, or stored in one of the squares. Follow your heart.

The complexity of inserting, deleting, and searching is O (n), n is the amount of information, however, the length of the string is usually less than N, so this time complexity notation lacks meaning.

Region Information Structure:
Quadtree

Bitree/quadtree/octree/hextree

Binary tree, four-yuan tree, eight-yuan tree, 16-yuan tree, divided into one or two, three or four-dimensional version.

Take a four-dollar Tree for example: the dividing plane is divided into four equal, the view situation can be divided down, forewarned more detail.

The information is placed in the tree leaves. The information can be anything, such as dots, lines, triangles.

The complexity of inserting, deleting, and searching is O (n), n is the amount of information, however, the height of the tree is usually less than n, so this time complexity notation lacks meaning. The exact time complexity is difficult to estimate, depending on the depth of the tree and the number of branches.

UVa 297 806 11941 11948

Region Information Structure:
K-dimensional Tree

K-dimensional Tree

Draw vertical lines and horizontal lines to divide the area. Since the concept of kd-tree, so we do not have another name, directly follow the old name.

The kd-tree of this place focuses on the boundaries of each pen, and the original Kd-tree, which focuses on the position of each of the coordinates, is followed by the first order. Two uses are different.

In the Top-down way, according to a certain axis sorting all the information (usually the most span of the axis), the information is divided into the left and right two piles, the recursive division down.

The complexity of inserting, deleting, and searching is O (n), n is the amount of information, however, the height of the tree is usually less than n, so this time complexity notation lacks meaning.

The missing point is: When the information across the region, I do not know where to place. Unless the information is a bit.

Region Information Structure:
Bounding Volume Hierarchy

Bounding Interval hierarchy/bounding region hierarchy/bounding Volume Hierarchy

BIH, BRH, BVH are the editions of one or two or three dimensions.

In the Top-down way, according to a certain axis sorting all the information (usually the most span of the axis), the information is divided into the left and right two piles, the recursive division down.

The complexity of inserting, deleting, and searching is O (n), n is the amount of information, however, the height of the tree is usually less than n, so this time complexity notation lacks meaning.

The advantage is: don't bother worries which area to place. You can rotate the nodes to make the tree balance.

UVa 12312

Region Information Structure:
R-tree

R-tree

Bounding Volume Hierarchy and B-tree.

From:http://www.csie.ntnu.edu.tw/~u91029/region.html#3