Zobrazeno 1 - 10
of 167
pro vyhledávání: '"DAMIAN, Mirela"'
Autor:
Damian, Mirela, Meijer, Henk
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, homeomorphic to a sphere. A polycube layer is the section of the polycube that lies between two horizontal cross-sections of the polycube at unit distanc
Externí odkaz:
http://arxiv.org/abs/2407.01326
Autor:
Aichholzer, Oswin, Ballinger, Brad, Biedl, Therese, Damian, Mirela, Demaine, Erik D., Korman, Matias, Lubiw, Anna, Lynch, Jayson, Tkadlec, Josef, Uno, Yushi
For a set $P$ of $n$ 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 pair of points and no two edges intersect except at a common endpoint. W
Externí odkaz:
http://arxiv.org/abs/2206.03879
Autor:
Akitaya, Hugo A., Arkin, Esther M., Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Korman, Matias, Palop, Belén, Parada, Irene, van Renssen, André, Sacristán, Vera
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precisely, we show that five extra "helper" modules ("musketeers") suffice to
Externí odkaz:
http://arxiv.org/abs/1908.07880
Autor:
Damian, Mirela, Flatland, Robin
Publikováno v:
In Computational Geometry: Theory and Applications February 2023 109
Autor:
Damian, Mirela, Flatland, Robin
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 required to be well-separated.
Comment: 42 pages, 39 figures. Prelim
Comment: 42 pages, 39 figures. Prelim
Externí odkaz:
http://arxiv.org/abs/1811.01842
We show that, unlike the Yao-Yao graph $YY_6$, the Theta-Theta graph $\Theta\Theta_6$ defined by six cones is a spanner for sets of points in convex position. We also show that, for sets of points in non-convex position, the spanning ratio of $\Theta
Externí odkaz:
http://arxiv.org/abs/1808.04744
Autor:
Damian, Mirela, Demaine, Erik, Dulieu, Muriel, Flatland, Robin, Hoffman, Hella, Hull, Thomas C., Lynch, Jayson, Ramaswami, Suneeta
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 valleys. A forcing set is a subset of creases that force all the othe
Externí odkaz:
http://arxiv.org/abs/1703.06373
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). This is the first result on unfolding general orthogonal polyhedra bey
Externí odkaz:
http://arxiv.org/abs/1611.00106
Autor:
Damian, Mirela, Nelavalli, Naresh
We establish an upper bound of 4.94 on the stretch factor of the Yao graph $Y_4^\infty$ defined in the $L_\infty$-metric, improving upon the best previously known upper bound of 6.31. We also establish an upper bound of 54.62 on the stretch factor of
Externí odkaz:
http://arxiv.org/abs/1602.05481
Autor:
Damian, Mirela, Flatland, Robin
Publikováno v:
In Computational Geometry: Theory and Applications October 2021 98