Let P be a simple polygon with n vertices, and let A be a set of m
point...
We study Snipperclips, a computer puzzle game whose objective is to crea...
We study the problem of polygonal curve simplification under uncertainty...
In this paper we study a wide range of variants for computing the (discr...
We study the geodesic Voronoi diagram of a set S of n linearly moving
si...
Let P be an x-monotone orthogonal polygon with n vertices. We call P
a s...
We study the computation of the diameter and radius under the rectilinea...
We prove a geometric version of the graph separator theorem for the unit...
Let P be a planar set of n sites in general position. For k∈{1,...,n-1},...
Given a collection L of line segments, we consider its arrangement and
s...