# Range searching

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

- Symposium on Computational Geometry
- 2011

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

2000

Highly Cited

2000

- FOCS
- 2000

We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the generalâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- 1997

About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cientâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Symposium on Computational Geometry
- 1995

The range searching problem is a fundamental problem in computational geometry, with numerous import ant applications. Mostâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- SODA
- 1995

1 Introduction and motivation External 2-dimensional range searching is a fundamental problem with many applications inâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Discrete & Computational Geometry
- 1994

Let P be a set of n points in ~d (where d is a small fixed positive integer), and let F be a collection of subsets of ~d, each ofâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Symposium on Computational Geometry
- 1992

We present an improved space/query time tradeoff for the general simplex range searching problem, matching known lower bounds upâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- J. ACM
- 1990

Lower bounds on the complexity of orthogonal range searching in thestatic case are established. Specifically, we consider theâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- J. ACM
- 1990

We establish lower bounds on the complexity of orthogonal range reporting in the static case. Given a collection of <italic>nâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- Acta Informatica
- 1978

In this paper we investigate the worst-case complexity of range searching: preprocess N points in k-space such that range queriesâ€¦Â (More)

Is this relevant?