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 …

Problems arising in diverse areas, such as VLSI layout design, database query-retrieval,
robotics, and computer graphics can often be formulated as geometric intersection …

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 …

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 …

Abstract Let T [1, n] be a text of length n and T [i, n] be the suffix starting at position i. Also, for
any two strings X and Y, let LCP (X, Y) denote their longest common prefix. The range-LCP …

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 …

We study range-searching for colored objects, where one has to count (approximately) the
number of colors present in a query range. The problems studied mostly involve orthogonal …

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

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 …