Live briefing
Everything about Range tree
Ordered tree data structure
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 efficiently, and is typically used in two or higher dimensions. Range trees were introduced by Jon Louis Bentley in 1979. Similar data structures were discovered independently by Lueker, Lee and Wong, and Willard. The range tree is an alternative to the k-d tree. Compared to k-d trees, range trees offer faster query times of but worse storage of, where n is the number of points stored in the tree, d is the dimension of each point and k is the number of points reported by a given query. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Range treeA 5-minute orientation
- Skim a recent paper: Tree species recognition from close-range sensing: A reviewInfluential work since 2022
- Pick up a classic book: A Tree Is NiceThe most-reprinted book on the subject
- Read the landmark paper: Limited filling of the potential range in European tree speciesCited 636 times
- Go sideways: Interval treeA closely related topic
- Go sideways: Fractional cascadingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Limited filling of the potential range in European tree species
Phenology is a major determinant of tree species range
Tree-species range shifts in a changing climate: detecting, modeling, assisting
Cryptic diversity among Western Palearctic tree frogs: Postglacial range expansion, range limits, and secondary contacts of three European tree frog lineages (Hyla arborea group)
The demography of range boundaries versus range cores in eastern US tree species
Predicted range shifts of alien tree species in Europe
Evidence of Tree Species’ Range Shifts in a Complex Landscape
Life stage, not climate change, explains observed tree range shifts
🆕 Influential since 2022
Tree species recognition from close-range sensing: A review
Climate mismatches with ectomycorrhizal fungi contribute to migration lag in North American tree range shifts
Climate change induced elevational range shifts of Himalayan tree species
Individual tree segmentation and species classification using high-density close-range multispectral laser scanning data
Reduced diurnal temperature range mitigates drought impacts on larch tree growth in North China
📚 Books worth reading
A Tree Is NiceJanice May Udry · 1956
The egg treeKatherine Milhous · 1950
Scrambled Eggs Super!Dr. Seuss, Tish Rabe · 1953
Of men and mountainsWilliam O. Douglas · 1950- 📕Notes on trees and shrubs in arid and semi-arid regionsMichel Baumer · 1983
Effects of long-range transboundary air pollutionUnited Nations. Economic Commission for Europe · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Fractional cascading In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures…
- 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…
- Segment tree In computer science, the segment tree is a data structure used for finding the result of some associative function on a contiguous sub-array (called segment)…
- X-fast trie In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries…
- 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…
- Range searching In computer science, the range searching problem consists of processing a set S of objects, in order to determine which objects from S intersect with a…
- Quadtree 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…