Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Binary heapComputer scienceHerbert EdelsbrunnerIntroduction to Algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A framework to compute statistics of system parameters from very large trace files
In this paper, we present a framework to compute, store and retrieve statistics of various system metrics from large traces in an… 
2012
2012
Marching cubes technique for volumetric visualization accelerated with graphics processing units
Volume visualization has numerous applications that benefit different knowledge domains, such as biology, medicine, meteorology… 
2012
2012
Quantifying recent variation and relatedness in human populations
Quantifying Recent Variation and Relatedness in Human Populations 
2010
2010
Perfect Sorting by Reversals and Deletions/Insertions
Recently, more and more people are interested in the problem of computing a sequence of rearrangement operations to transform one… 
2009
2009
Substring Statistics
The goal of this work is to make it practical to compute corpus-based statistics for all substrings (ngrams). Anything you can do… 
2005
2005
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database… 
2005
2005
Tree population changes in a tropical dry evergreen forest of south India over a decade (1992–2002)
Changes in species composition and density of trees >10 cm gbh in a tropical dry evergreen forest in Puthupet, south India are… 
Review
2002
Review
2002
A Survey and a New Competitive Method for the Planar min-# Problem
We survey most of the different types of approximation algorithms which minimize the number of output vertices. We present their… 
2001
2001
Object-Relational Indexing for General Interval Relationships
Intervals represent a fundamental data type for temporal, scientific, and spatia l databases where time stamp s and point data… 
1992
1992
Adaptive representation of histogram using interval tree
Proposes a new data structure, called histogram interval tree, to represent a distribution of gray levels in terms of intervals… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)