12 citations · 48 across the 27 of their papers we have counts for
4 papers · 1 filter
Time-Space Trade-off Algorithms for Triangulating a Simple Polygon
Boris Aronov, Matias Korman, Simon Pratt +2
An -workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses additional words of space. We…
Time-Space Trade-offs for Triangulations and Voronoi Diagrams
Matias Korman, Wolfgang Mulzer, Andre van Renssen +3
Let be a planar -point set. A triangulation for is a maximal plane straight-line graph with vertex set . The Voronoi diagram for is the subdivision of the plane i…
On interference among moving sensors and related problems
Jean-Lou De Carufel, Matya Katz, Matias Korman +3
We show that for any set of points moving along "simple" trajectories (i.e., each coordinate is described with a polynomial of bounded degree) in and any parameter $2 \…
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel +2
Consider a weighted graph G where vertices are points in the plane and edges are line segments. The weight of each edge is the Euclidean distance between its two endpoints. A routi…