20 citations · 44 across the 25 of their papers we have counts for
31 papers
Unfolding Polycubes with Orthogonally Convex Layers
Mirela Damian, Henk Meijer
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying bet…
Reconfiguration of Non-crossing Spanning Trees
Oswin Aichholzer, Brad Ballinger, Therese Biedl +7
For a set of points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pa…
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…
Spanning Properties of Theta-Theta-6
Mirela Damian, John Iacono, Andrew Winslow
We show that, unlike the Yao-Yao graph , the Theta-Theta graph defined by six cones is a spanner for sets of points in convex position. We also show that, for sets of…
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…