thumb|300px|A point-region quadtree with point data. Bucket capacity 1. thumb|300x300px|Quadtree compression of an image step by step. Left shows the compressed image with the tree bounding boxes while the right shows just the compressed image A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with a leaf cell varies by application, but the leaf cell represents a
In the Vinony graph
Within Vinony's link graph, 四叉树 is referenced by 142 other articles, and connects out to B-tree, tree and binary space partitioning.
Vinony files it under Database index techniques, Geometric data structures and Rectangular subdivisions.
Its subject is documented across 15 Wikipedia language editions.
Key facts
- Data structure.name
- Quadtree
- Data structure.type
- Tree
- Data structure.invented_by
- Raphael Finkel and J.L. Bentley
- Data structure.invented_year
- 1974
via Wikipedia infobox
Wikidata facts
- Instance of
- data structure
- Subclass of
- spatial index
- Image
- Point quadtree.svg
Show 2 more facts
- Commons category
- Quadtrees
- maintained by WikiProject
- WikiProject Mathematics
Sources (2)
via Wikidata · CC0
Article · 中文
四元樹是一種樹狀資料結構，在每一個節點上會有四個子區塊。四元樹常應用於二維空間資料的分析與分類。 它將資料區分成為四個象限。資料範圍可以是方形或矩形或其他任意形狀。這種資料結構是由 (Raphael Finkel) 與 在1974年發展出來 。 類似的資料分割方法也稱為 Q-tree。 所有的四元樹法有共同之特點: * 可分解成為各自的區塊 * 每个区块都有节点容量。当节点达到最大容量时，节点分裂 * 樹狀資料結構依造四元樹法加以區分
Abstract from DBpedia / Wikipedia · CC BY-SA