Live briefing
Everything about Quadtree
Tree data structure that partitions a 2D area
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 "unit of interesting spatial information". Wikipedia →
đź§ Start here: a 6-step reading path
- Read the overview: QuadtreeA 5-minute orientation
- Skim a recent paper: Parameter Estimation for Open Clusters using an Artificial Neural Network with a QuadTree-based Feature ExtractorInfluential work since 2022
- Pick up a classic book: Experimental AlgorithmsThe most-reprinted book on the subject
- Read the landmark paper: The Quadtree and Related Hierarchical Data StructuresCited 1,639 times
- Go sideways: OctreeA closely related topic
- Go sideways: Range treeA closely related topic
đź“– Definitions
Noun 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.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The Quadtree and Related Hierarchical Data Structures
A quadtree-adaptive multigrid solver for the Serre–Green–Naghdi equations
Adaptive quadtree simulation of shallow flows with wet–dry fronts over complex topography
Quadtree-based multi-focus image fusion using a weighted focus-measure
A Modified Quadtree Approach To Finite Element Mesh Generation
Efficient quadtree coding of images and video
Adaptation of quadtree meshes in the scaled boundary finite element method for crack propagation modelling
Discrete Markov image modeling and inference on the quadtree
🆕 Influential since 2022
Parameter Estimation for Open Clusters using an Artificial Neural Network with a QuadTree-based Feature Extractor
QIS-GAN: A Lightweight Adversarial Network With Quadtree Implicit Sampling for Multispectral and Hyperspectral Image Fusion
Depth Estimation Using a Self-Supervised Network Based on Cross-Layer Feature Fusion and the Quadtree Constraint
A direct time-domain FEM-SBFEM-SBPML method for soil-structure interaction analysis using quadtree mesh
QA-USTNet: Yarn-dyed fabric defect detection via U-shaped Swin Transformer Network based on Quadtree Attention
📚 Books worth reading
Experimental AlgorithmsVincenzo Bonifaci · 2013
Algorithm designMichael T. Goodrich, Roberto Tamassia · 2001- 📕Data Structures the Fun WayJeremy Kubica · 2022
- 📕Experiments in encoding multilevel images as quadtreesDonald L. Lansing · 1987
Spatial data managementNikos Mamoulis · 2011
Algorithm Design and ApplicationsMichael T. Goodrich, Roberto Tamassia · 2014- 📕Finite element mesh generation with modified quadtree techniqueStephen C-H Law · 1985
- đź“•Algorithms for the conversion of quadtrees to rastersH. Samet
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Octree An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three-dimensional…
- Range tree In computer science, a range tree is an ordered tree data structure to hold a list of points. It allows all points within a given range to be reported…
- K-d tree Wikimedia Commons has media related to k-d trees. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure…
- Interval tree In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap…
- Priority search tree In computer science, a priority search tree is a tree data structure for storing points in two dimensions. It was originally introduced by Edward M. McCreight…
- B-tree In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and…
- Vantage-point tree A vantage-point tree (or VP tree) is a metric tree that segregates data in a metric space by choosing a position in the space (the "vantage point") and…
- Hashlife Hashlife is a memoized algorithm for computing the long-term fate of a given starting configuration in Conway's Game of Life and related cellular automata…