Range closest-pair (RCP) search is a range-search variant of the classical closest-pair
problem, which aims to store a given set S of points into some space-efficient data structure …

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

The range closest-pair (RCP) problem, as a range-search version of the classical closest-
pair problem, aims to store a dataset of points in some data structure such that whenever a …

We consider a range-search variant of the closest-pair problem. Let $\varGamma $ be a
fixed shape in the plane. We are interested in storing a given set of $ n $ points in the plane …

The range closest-pair (RCP) problem is the range-search version of the classical closest-
pair problem, which aims to store a given dataset of points in some data structure such that …

In the range closest pair problem, we want to construct a data structure storing a set S of n
points in the plane, such that for any axes-parallel query rectangle R, the closest pair in the …

The range closest-pair (RCP) problem, as a rangesearch version of the classical closest-pair
problem, aims to store a dataset of points in some data structure such that whenever a query …

Given two object sets P and Q, a k-closest pairs (k-CP) query finds k closest object pairs from
P× Q. This operation is common in many real-life applications such as GIS, data mining and …

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

Let S be a set of n weighted points in the plane and let R be a query range in the plane. In
the range closest pair problem, we want to report the closest pair in the set R∩ S. In the …