Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

13 relations
CGALComputer scienceData structureFractional cascading
Expand

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… Expand
Is this relevant?
2006
2006
On the database/network interface in large-scale publish/subscribe systems
The work performed by a publish/subscribe system can conceptually be divided into subscription processing and notification… Expand
  • figure 1
  • figure 4
  • figure 5
  • table 1
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The Buffer Tree: A Technique for Designing Batched External Data Structures
  • L. Arge
  • Algorithmica
  • 2003
    • Corpus ID: 11054532
We present a technique for designing external memory data structures that support batched operations I/ O efficiently. We show… Expand
  • figure 1
  • figure 6
  • figure 7
  • figure 10
Is this relevant?
2000
2000
Fast software for box intersections
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a… Expand
  • figure 1
  • figure 3
  • figure 8
  • figure 9
  • figure 12
Is this relevant?
Highly Cited
2000
Highly Cited
2000
New data structures for orthogonal range searching
We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general… Expand
  • table 1
  • table 2
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… Expand
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Generalized intersection searching problems
A new class of geometric intersection searching problems is introduced, which generalizes previously-considered intersection… Expand
Is this relevant?
1987
1987
Maintaining range trees in secondary memory. Part I: Partitions
Mark T. de Berg· Range trees can be used for solving the orthogonal range searching problem, a problem that has applications in e… Expand
Is this relevant?
Highly Cited
1953
Highly Cited
1953
Effects of Clipping on Some Range Shrubs.
numbers in balance with the forage supply. If an area is supporting less game than the available feed will permit, game managers… Expand
  • table 1
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE