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… (More)
Wikipedia

Related topics

Related topics

13 relations
CGALComputer scienceData structureFractional cascading
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Orthogonal range searching on the RAM, revisited
We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Measurement Matrix Design for Compressive Sensing–Based MIMO Radar
In colocated multiple-input multiple-output (MIMO) radar using compressive sensing (CS), a receive node compresses its received… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The Buffer Tree: A Technique for Designing Batched External Data Structures
We present a technique for designing external memory data structures that support batched operations I/ O efficiently. We show… (More)
  • figure 1
  • figure 6
  • figure 7
  • figure 10
Is this relevant?
Highly Cited
1999
Highly Cited
1999
On Two-Dimensional Indexability and Optimal Range Search Indexing
In this paper we settle several longstanding open problems in theory of indexability and external orthogonal range searching. In… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The Buffer Tree: A New Technique for Optimal I/O Algorithms
In this paper we develop a technique for transforming an internal memory tree data structure into an external storage structure… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The P-range Tree: A New Data Structure for Range Searching in Secondary Memory
1 Introduction and motivation External 2-dimensional range searching is a fundamental problem with many applications in… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
In this paper we develop a technique for transforming an internalmemory tree data structure into an external-memory structure. We… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
1993
1993
The Point-Range Tree: A Data Structure for Indexing Intervals
<italic>In this paper, we propose a data structure, the Point-Range Tree (PR-Tree), specifically designed for indexing intervals… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Lower Bounds for Orthogonal Range Searching: I. The Reporting Case
We establish lower bounds on the complexity of orthogonal range reporting in the static case. Given a collection of <italic>n… (More)
  • figure 1
Is this relevant?
1990
1990
Maintaining range trees in secondary memory
When storing and maintaining a data structure in secondary memory it is important to partition it into parts such that each query… (More)
Is this relevant?