1. QuadtreeA quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are most often used to partition a two dimensional space by recursively subdividing it into four quadrants or regions. The regions may be square or rectangular, or may have arbitrary shapes. This data structure was named a quadtree by Raphael Finkel and J.L. Bentley in 1974. A similar partitioning is also known as a Q-tree.
Read “Quadtree” on English Wikipedia
Read “四分木” on Japanese Wikipedia
Read “Quadtree” on DBpedia
Read “Quadtree” on English Wikipedia
Read “四分木” on Japanese Wikipedia
Read “Quadtree” on DBpedia
Discussions
Log in to talk about this word.