Any surface that is intrinsically polyhedral can be represented by a
col...
A geometric t-spanner for a set S of n point sites is an edge-weighted
g...
We devise a data structure that can answer shortest path queries for two...
Let P be a set of n colored points. We develop efficient data structures...
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...
Our aim is to develop dynamic data structures that support k-nearest
nei...
Given two distributions P and S of equal total mass, the Earth Mover's
D...
An important task when working with terrain models is computing viewshed...
We study three covering problems in the plane. Our original motivation f...
We study the geodesic Voronoi diagram of a set S of n linearly moving
si...
We study continuous analogues of "vitality" for discrete network flows/p...
We consider the problem of testing, for a given set of planar regions
R...
We present an efficient dynamic data structure that supports geodesic ne...
We study the problem of convexifying drawings of planar graphs. Given an...
We present an efficient dynamic data structure that supports geodesic ne...
We study an agglomerative clustering problem motivated by interactive gl...