92 citations · 169 across the 11 of their papers we have counts for
13 papers
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…
Reconfiguration of Connected Graph Partitions via Recombination
Hugo A. Akitaya, Matias Korman, Oliver Korten +2
Motivated by applications in gerrymandering detection, we study a reconfiguration problem on connected partitions of a connected graph . A partition of is \emph{connected…
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…
Reconfiguration of Connected Graph Partitions
Hugo A. Akitaya, Matthew D. Jones, Matias Korman +5
Motivated by recent computational models for redistricting and detection of gerrymandering, we study the following problem on graph partitions. Given a graph and an integer $k\…
The Flip Diameter of Rectangulations and Convex Subdivisions
Eyal Ackerman, Michelle M. Allen, Gill Barequet +4
We study the configuration space of rectangulations and convex subdivisions of points in the plane. It is shown that a sequence of elementary flip and rotate opera…