出典:Wiktionary
出典:『Wiktionary』 (2026/09/20 01:10 UTC 版)
quadtree (plural quadtrees)
出典:Wikipedia
出典:『Wikipedia』 (2011/08/01 17:51 UTC 版)
A 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. All forms of Quadtrees share some common features:
| ・Quadtree | |
| ・Pinggu | |
| ・ORDO | |
| ・Craig Crowe | |
| ・kunitsune | |
| ・parapleuron | |
| ・dan spitz | |
| ・JBBY | |
| ・BMP2B1 | |
| ・clockarium |