10 citations · 25 across the 28 of their papers we have counts for
8 papers · 1 filter
Face flips in origami tessellations
Hugo A. Akitaya, Vida Dujmovi, David Eppstein +3
Given a flat-foldable origami crease pattern (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment …
Folding Polyominoes with Holes into a Cube
Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung +9
When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present s…
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The Musketeers
Hugo A. Akitaya, Esther M. Arkin, Mirela Damian +8
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precise…
Rock Climber Distance: Frogs versus Dogs
Hugo A. Akitaya, Leonie Ryvkin, Csaba D. Tóth
The classical measure of similarity between two polygonal chains in Euclidean space is the Fréchet distance, which corresponds to the coordinated motion of two mobile agents along…
The -Fréchet distance
Hugo A Akitaya, Maike Buchin, Leonie Ryvkin +1
We introduce a new distance measure for comparing polygonal chains: the -Fréchet distance. As the name implies, it is closely related to the well-studied Fréchet distance but de…
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\…
Infinite All-Layers Simple Foldability
Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron +3
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitay…