The Quadtree reference article from the English Wikipedia on 24-Jul-2004 (provided by Fixed Reference: snapshots of Wikipedia from wikipedia.org)

Quadtree

A quadtree is a tree data structure in which each internal node has up to four children. Quadtrees are most often used to partition a two dimensional space by recursively subdividing it into four quadrants.

Some common uses of quadtrees are:

• Image representation
• Spatial indexing
• Efficient collision detection in two dimensions
• View frustum culling of terrain data

Quadtrees are the two-dimensional analog of octrees.

See also: data structure

External links

• Spatial Index Demos

This article is a stub. You can help Wikipedia by expanding it.

This is the "Quadtree" reference article from the English Wikipedia. All text is available under the terms of the GNU Free Documentation License. See also our Disclaimer.