The Fréchet distance is one of the most studied distance measures betwee...
A directed graph G is upward planar if it admits a planar embedding such...
We give simple algorithms for maintaining edge-orientations of a
fully-d...
We study dynamic planar graphs with n vertices, subject to edge deletion...
We study the problem of constructing a data structure that can store a
t...
Let P be a simple polygon with n vertices, and let A be a set of m
point...
The Fréchet distance is a well-studied similarity measure between curves...
In the preprocessing model for uncertain data we are given a set of regi...
We propose a new paradigm for robust geometric computations that complem...
Consider an ordered point set P = (p_1,...,p_n), its order type (denoted...
Let R = {R_1, R_2, ..., R_n} be a set of regions and let X = {x_1,
x_2,...
We study the k-center problem in a kinetic setting: given a set of
conti...
We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with
...
In this note we show by example that the algorithm presented in 1979 by
...
We revisit the following problem: Given a convex polygon P, find the
lar...