bn:03390741n
Noun Concept
Categories: Trees (data structures), Articles with short description, Database index techniques, Geometric data structures
EN
quadtree  Point Region QuadTree  quad-tree  Quad tree  quadtree decomposition
EN
A quadtree is a tree data structure in which each internal node has exactly four children. Wikipedia
Definitions
Relations
Sources
EN
A quadtree is a tree data structure in which each internal node has exactly four children. Wikipedia
Tree data structure in which each internal node has exactly four children Wikidata
A treelike data structure each of whose nodes has up to four children, most often used to partition a two-dimensional space by recursively subdividing it. Wiktionary
Wikipedia
Wikidata
Wiktionary