In a spatial join, we are given a constant number k≥ 2 of sets-denoted as R1, R2,..., Rk-
containing axis-parallel rectangles in a 2D space. The objective is to report all k-tuples (r1 …

Given a set of n points in the plane, range diameter queries ask for the furthest pair of points
in a given axis-parallel rectangular range. We provide evidence for the hardness of …

We study the following problem: preprocess a set OO of objects into a data structure that
allows us to efficiently report all pairs of objects from OO that intersect inside an axis-aligned …

Let S be a set of n points in the plane. We present data structures that solve range-
aggregate query problems on three geometric extent measure problems. Using these data …

We consider the following problem: Preprocess a set S of n axis-parallel boxes in R d so that
given a query with an axis-parallel box in R d, the pairs of boxes of S whose intersection …

Range-aggregate query is an important type of queries with numerous applications. It aims
to obtain some structural information (defined by an aggregate function $ F (\cdot) $) of the …

Computational geometry is a branch of computer science which deals with computation of
geometric functions. It has applications in diverse fields such as computer graphics, robotics …

Let S be a set of n points in the plane. We present a method where, using O (n log2 n) time
and space, S can be pre-processed into a data structure such that given an axis-parallel …

The range searching problem is one of the most studied problems in computational
geometry. In this paper, we study the following range-searching problem. Given a set of n …

The amount of data that are being generated, collected, and stored is growing rapidly and a
large body of the data are geometric in nature. A clear example of this is in geography …