5 citations · 13 across the 11 of their papers we have counts for
14 papers
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…
Unfolding Polycube Trees with Constant Refinement
Mirela Damian, Robin Flatland
We show that every polycube tree can be unfolded with a 4x4 refinement of the grid faces. This is the first constant refinement unfolding result for polycube trees that are not req…
Minimal forcing sets for 1D origami
Mirela Damian, Erik Demaine, Muriel Dulieu +5
This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or…
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement
Mirela Damian, Erik Demaine, Robin Flatland +1
We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges).…
Minimum Forcing Sets for Miura Folding Patterns
Brad Ballinger, Mirela Damian, David Eppstein +3
We introduce the study of forcing sets in mathematical origami. The origami material folds flat along straight line segments called creases, each of which is assigned a folding dir…
Unfolding Orthogrids with Constant Refinement
Mirela Damian, Erik Demaine, Robin Flatland
We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.