Live briefing
Everything about Interval tree
Tree data structure to hold intervals
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 with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene. A similar data structure is the segment tree. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Interval treeA 5-minute orientation
- Skim a recent paper: Aerospace Equipment Fault Diagnosis Method Based on Fuzzy Fault Tree Analysis and Interpretable Interval Belief Rule BaseInfluential work since 2022
- Pick up a classic book: PoemsThe most-reprinted book on the subject
- Read the landmark paper: The robust spanning tree problem with interval dataCited 130 times
- Go sideways: Range 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)
The robust spanning tree problem with interval data
On the complexity of the robust spanning tree problem with interval data
Interval methods for fault-tree analysis in robotics
Tree 3-spanners on interval, permutation and regular bipartite graphs
The interval B-tree
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
IIVFDT: IGNORANCE FUNCTIONS BASED INTERVAL-VALUED FUZZY DECISION TREE WITH GENETIC TUNING
T3C: improving a decision tree classification algorithm’s interval splits on continuous attributes
🆕 Influential since 2022
Aerospace Equipment Fault Diagnosis Method Based on Fuzzy Fault Tree Analysis and Interpretable Interval Belief Rule Base
RETRACTED: Distance learning quality assessment of universities based on interval monotonic decision tree algorithm
HIE-EDT: Hierarchical interval estimation-based evidential decision tree
Bayesian network approach for dynamic fault tree with common cause failures and interval uncertainty parameters
Noninvasive system for weight estimation in cactus crops: A YOLOv5-decision tree approach based on interval type-2 fuzzy sets
📚 Books worth reading
PoemsRobert Frost · 1923
Structure and Interpretation of Computer Programs (SICP)Harold Abelson, Gerald Jay Sussman · 1985
Language and Automata Theory and ApplicationsAdrian-Horia Dediu · 2012
Sketches of the life, times and character of the Rt. Rev. Benedict Joseph Flaget, First Bishop of LouisvilleM. J. Spalding · 1852
David BowieSean Egan · 2013
Fundamentals of data structures in CEllis Horowitz · 1993
Data science from scratchJoel Grus · 2015
Following the waterDavid M. Carroll · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- 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…
- 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)…
- M-ary tree In graph theory, an m-ary tree (for nonnegative integers m) (also known as n-ary, k-ary, k-way or generic tree) is an arborescence (or, for some authors…
- LCP array In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest…
- 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…
- Bx-tree In computer science, the Bx tree is a query that is used to update efficient B+ tree-based index structures for moving objects. The base structure of the…
- Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…