research
∙
01/10/2022
Segment Visibility Counting Queries in Polygons
Let P be a simple polygon with n vertices, and let A be a set of m point...
share
research
∙
05/18/2021
Snipperclips: Cutting Tools into Desired Polygons using Themselves
We study Snipperclips, a computer puzzle game whose objective is to crea...
research
∙
03/16/2021
Uncertain Curve Simplification
We study the problem of polygonal curve simplification under uncertainty...
research
∙
04/24/2020
Fréchet Distance for Uncertain Curves
In this paper we study a wide range of variants for computing the (discr...
research
∙
02/14/2020
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
We study the geodesic Voronoi diagram of a set S of n linearly moving si...
research
∙
02/18/2019
Routing in Histograms
Let P be an x-monotone orthogonal polygon with n vertices. We call P a s...
research
∙
12/15/2017
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
We study the computation of the diameter and radius under the rectilinea...
research
∙
09/08/2017
Balanced Line Separators of Unit Disk Graphs
We prove a geometric version of the graph separator theorem for the unit...
research
∙
08/02/2017
Improved Time-Space Trade-offs for Computing Voronoi Diagrams
Let P be a planar set of n sites in general position. For k∈{1,...,n-1},...
research
∙
08/02/2017
