Everything About ___
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

  1. Read the overview: QuadtreeA 5-minute orientation
  2. Skim a recent paper: Parameter Estimation for Open Clusters using an Artificial Neural Network with a QuadTree-based Feature ExtractorInfluential work since 2022
  3. Pick up a classic book: Experimental AlgorithmsThe most-reprinted book on the subject
  4. Read the landmark paper: The Quadtree and Related Hierarchical Data StructuresCited 1,639 times
  5. Go sideways: OctreeA closely related topic
  6. 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.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics