A central problem in computational geometry, range searching arises in many applications,
and a variety of geometric problems can be formulated as range-searching problems. A …

This article addresses the MaxRS (Maximizing Range Sum) monitoring problem. Given a set
of weighted spatial stream objects, this problem is to monitor a location of a user-specified …

Let P be a set of n (non-negatively) weighted points in Rd. We consider the problem of
computing a subset of (at most) k diverse and high-valued points of P that lie inside a query …

In this work, we present a collection of new results on two fundamental problems in
geometric data structures: orthogonal point location and rectangle stabbing.-We give the first …

The hypervolume subset selection problem (HSSP) aims at approximating a set of n
multidimensional points in R d with an optimal subset of a given size. The size k of the …

Let D be a set of n elements each associated with a real-valued weight, and Q be the set of
all possible predicates allowed on those elements. Given a predicate in Q and integer k, a …

In this work, we present a plethora of results for the range longest increasing subsequence
problem (Range-LIS) and its variants. The input to Range-LIS is a sequence $\mathcal {S} …

Given a dataset $ S $ of points in $\mathbb {R}^ 2$, the range closest-pair (RCP) problem
aims to preprocess $ S $ into a data structure such that when a query range $ X $ is …

Top-k search, which reports the k elements of the highest importance from all the elements
in an underlying dataset that satisfy a certain predicate, has attracted significant attention …

An external memory data structure is presented for maintaining a dynamic set of $ N $ two-
dimensional points under the insertion and deletion of points, and supporting 3-sided range …