92 citations · 169 across the 11 of their papers we have counts for
8 papers · 1 filter
An Improved Bound for Plane Covering Paths
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz +8
A covering path for a finite set of points in the plane is a polygonal path such that every point of lies on a segment of the path. The vertices of the path need not be at…
Reconfiguration of Polygonal Subdivisions via Recombination
Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine +2
Motivated by the problem of redistricting, we study area-preserving reconfigurations of connected subdivisions of a simple polygon. A connected subdivision of a polygon $\mathcal{R…
Circumscribing Polygons and Polygonizations for Disjoint Line Segments
Hugo A. Akitaya, Matias Korman, Oliver Korten +3
Given a planar straight-line graph in , a \emph{circumscribing polygon} of is a simple polygon whose vertex set is , and every edge in is eit…
Diffuse Reflection Diameter in Simple Polygons
Gill Barequet, Sarah M. Cannon, Eli Fox-Epstein +4
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with walls from a…
Bichromatic compatible matchings
Greg Aloupis, Luis Barba, Stefan Langerman +1
For a set of red points and a set of blue points, a -matching is a non-crossing geometric perfect matching where each segment has one endpoint in and one in…
Hidden Mobile Guards in Simple Polygons
Sarah Cannon, Diane L. Souvaine, Andrew Winslow
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most ot…