What is Quadtree?

Quadtree is a structure similar to a tree -based tree and used to organize files in a database. Each parent or starting node has four children's nodes and each child holds a certain amount of data. When the data restriction spills over the boundary, four children will be made from this node. There are two main structures of Quadytree: an area and a point tree, each of which is slightly different in design. While Quadtree is most commonly used with databases, it can also be used to find pixels in two -dimensional (2D) images, as pixels in 2D images can always be divided into four parts. The parent is the starting point and contains wide data based on the category while the child holds files and documents. In Quadtree, each parent must have four children. Although there must be four children, not all children must contain data; Those without them are known as zero nodes. These zero nodes often remain and wait for data.

Every children's node in Quadtree has a data limit. This limit is usually defined by the total size of the database. When there is so much information that it moves beyond the boundary, the child node becomes a parental node basically birth - creating four children's nodes that occupy all other data. There will usually be one or two zero nodes from this creation, but it depends on how much data there was in the node.

There are two main Quadtrees: Region and Point. The Quadtree Region is used to distribute the entire 2D area on part of the four - for example four, eight or 16 parts - and is often used for representation. This structure is best for images or charts of data field. The point version is like a binary tree and is best used with ordered points. This variant is also a real tree, because there is a central point of the chain of all nodes of the spring, unlike the version of the area in which the nodes are scattered.

The most common use of Quadtree is to separate and organoVAT database, but this is not the only use. Algorithms created to find a specific pixel in the picture normally use Quadtrees, because each pixel in the figure can be divided into four equal parts. This makes Quadytrees uniquely suitable for searching for pixels.