31 citations · 157 across the 51 of their papers we have counts for
7 papers · 1 filter
Weight Balancing on Boundaries
Luis Barba, Otfried Cheong, Michael Gene Dobbins +8
Given a polygonal region containing a target point (which we assume is the origin), it is not hard to see that there are two points on the perimeter that are antipodal, that is, wh…
Computing the Geodesic Centers of a Polygonal Domain
Sang Won Bae, Matias Korman, Yoshio Okamoto
We present an algorithm that computes the geodesic center of a given polygonal domain. The running time of our algorithm is for any , where is the number of…
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 \…
The Dual Diameter of Triangulations
Matias Korman, Stefan Langerman, Wolfgang Mulzer +3
Let $\Poly$ be a simple polygon with vertices. The \emph{dual graph} $\triang^*$ of a triangulation~$\triang$ of~$\Poly$ is the graph whose vertices correspond to the bounded f…