Skip to search formSkip to main contentSkip to account menu

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
This paper presents the design and implementation of an all-programmable frequency divider with an ultra-wide division range for… 
2008
2008
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in ℝ2 and a query distribution D… 
2008
2008
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q, all colors c, such that at least… 
2008
2008
This research note documents estimation procedures and results for an empirical investigation of the performance of the recently… 
2005
2005
We consider variations of the standard orthogonal range searching motivated by applications in database querying and VLSI layout… 
2005
2005
We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for… 
1989
1989
A kaolinite-pyridine intercalation compound was prepared using hydrated kaolinite as an intermediate. Hydrated kaolinite having a…