A central problem in computational geometry, range searching arises in many applications,
and numerous geometric problems can be formulated in terms of range searching. A typical …

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 …

Consider an ordinal tree T on n nodes, each of which is assigned a category from an
alphabet [σ]={1, 2,…, σ}. We preprocess the tree T in order to support categorical path …

We present a number of new results about range searching for colored (or" categorical")
data: 1. For a set of $ n $ colored points in three dimensions, we describe randomized data …

Range searching on categorical, or “colored”, data has been studied extensively for over two
decades. In this paper, we obtain the current best results for perhaps the most basic, and …

In this paper we study succinct data structures for one-dimensional color reporting and color
counting problems. We are given a set of n points with integer coordinates in the range [1, m] …

In this paper, we consider a variant of the color range reporting problem called color
reporting with frequencies. Our goal is to pre-process a set of colored points into a data …

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

Data gathered from location-aware devices, such as GPS, create opportunities for
researchers to extract interesting information from the movement of objects. Popular places …

The skyline of a set of two-dimensional points is the subset of points not dominated by any
other point. In this paper, we consider a set of two-dimensional points (in rank space) that …