چاردرخت
Sign in to savethumb|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
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