Segment tree

In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2017
024619842017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
This paper presents a novel tree-based cost aggregation method for dense stereo matching. Instead of employing the minimum… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Range query, which is defined as to find all the keys in a certain range over the underlying P2P network, has received a lot of… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
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?
2001
2001
We present anew technique to maintain a BSP for a set of n moving disj oint segments in the plane. Our kinetic BSP uses O(n log n… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2000
2000
AbsfructAs Internet grows into a commercial infrastructure, more and more network services require routers to classify packets… (More)
  • table I
  • figure 1
  • table I
  • figure 2
  • figure 3
Is this relevant?
1999
1999
This paper presents a ray tracer that facilitates near-interactive scene editing with incremental rendering; the user can edit… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
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?
Highly Cited
1995
Highly Cited
1995
In this paper we develop a technique for transforming an internal-memory tree data structure into an external-memory structure… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We consider a variety of problems on the interaction between two sets of line segments in two and three dimensions. These… (More)
  • figure 2.1
  • figure 6.1
  • figure 6.2
Is this relevant?
1993
1993
A new data structure—the union-copy structure —is introduced, which generalizes the well-known union-find structure. Besides the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?