Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2011

Highly Cited

2011

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

The work performed by a publish/subscribe system can conceptually be divided into subscription processing and notification… Expand

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

Is this relevant?

2000

2000

We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

In this paper we settle several longstanding open problems in theory of indexability and external orthogonal range searching. In… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

1 Introduction and motivation External 2-dimensional range searching is a fundamental problem with many applications in… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

A new class of geometric intersection searching problems is introduced, which generalizes previously-considered intersection… Expand

Is this relevant?

1987

1987

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

numbers in balance with the forage supply. If an area is supporting less game than the available feed will permit, game managers… Expand

Is this relevant?