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 …

Modern tracking technology has made the collection of large numbers of densely sampled
trajectories of moving objects widely available. We consider a fundamental problem …

In the semialgebraic range searching problem, we are given a set of n points in ℝ d, and we
want to preprocess the points such that for any query range belonging to a family of constant …

In this paper, we study the role non-adaptivity plays in maintaining dynamic data structures.
Roughly speaking, a data structure is non-adaptive if the memory locations it reads and/or …

Polynomial partitioning techniques have recently led to improved geometric data structures
for a variety of fundamental problems related to semialgebraic range searching and …

We revisit the classic problem of simplex range searching and related problems in
computational geometry. We present a collection of new results which improve previous …

We study data structure problems related to document indexing and pattern matching
queries and our main contribution is to show that the pointer machine model of computation …

Semialgebraic range searching, arguably the most general version of range searching, is a
fundamental problem in computational geometry. In the problem, we are to preprocess a set …

This paper considers enumerating answers to similarity-join queries under dynamic
updates: Given two sets of $ n $ points $ A, B $ in $\mathbb {R}^ d $, a metric $\phi (\cdot) …