Let P be a set of n points in R^d, so that each point is colored by one of C given colors. We
present algorithms for preprocessing P into a data structure that efficiently supports queries …

In orthogonal range reporting we are to preprocess N points in d-dimensional space so that
the points inside a d-dimensional axis-aligned query box can be reported efficiently. This is …

Widespread availability of location aware devices (such as GPS receivers) promotes capture
of detailed movement trajectories of people, animals, vehicles and other moving objects. We …

Motivated by information retrieval applications, we consider the one-dimensional colored
range reporting problem in rank space. The goal is to build a static data structure for sets C …

Let P be a set of n points in Rd, so that each point is colored by one of C given colors. We
present algorithms for preprocessing P into a data structure that efficiently supports queries …

We develop efficient algorithms for a number of generalized intersection reporting problems,
including orthogonal and general segment intersection, 2D range searching, rectangular …

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 …

Given a polyhedral terrain T with n vertices, the two-watchtower problem for T calls for
finding two vertical segments, called watchtowers, of smallest common height, whose bottom …

Given a polyhedral terrain T with n vertices, the two-watchtower problem for T asks to find
two vertical segments, called watchtowers, of smallest common height, whose bottom …

In this paper we give a fully dynamic data structure to maintain the connectivity of the
intersection graph of n axis-parallel rectangles. The amortized update time (insertion and …