Abstract Unfolding Manhattan Towers (2008)
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls in a particular shape class we call Manhattan Towers, to a planar simple orthogonal polygon. The algorithm...
Curves in the Sand: Algorithmic Drawing (2008)
Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Dania El-khechen, Robin Flatl, ...
Ethnomathematics is the study of mathematics in the works of art of various cultures [3, 4, 10, 14]. The concepts in this
Linear Reconfiguration of Cube-Style Modular Robots (2008)
Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatl, Vera Sacristán, ...
In this paper we propose a novel algorithm that, given a source robot S and a target robot T, reconfigures S into T. Both S and T are robots composed of n atoms arranged in 2×2×2 meta-modules. The...
Curves in the Sand: Algorithmic Drawing (2008)
Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Dania El-khechen, Robin Flatl, ...
The field of ethnomathematics is the study of mathematics in the works of art of various cultures [2, 3, 9, 13]. The concepts
Unfolding Manhattan Towers 1 (2008)
Mirela Damian A, Robin Flatl, Joseph O’rourke C
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The...
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n 2) “moves ” between simple polygons. Each move is composed of a sequence of atomic moves...
The problem of wireless localization introduced in [EGS07] asks to place a set of fixed localizers (guards) in the plane so as to enable mobile communication devices to prove that they are inside or...
Linear Reconfiguration of Cube-Style Modular Robots (2008)
Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatl, ...
In this paper we propose a novel algorithm for both contracting and expanding cube-style modular robots which reconfigures any given source robot composed of n atoms into any given target robot with...
1 Introduction Unfolding Well-Separated Orthotrees (2008)
Because of the difficulty of the long-standing open problem of deciding whether every convex polyhedron
Curves in the Sand: Algorithmic Drawing (2008)
Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Dania El-khechen, Robin Flatl, ...
Ethnomathematics is the study of mathematics in the works of art of various cultures [3, 4, 10, 14]. The concepts in this
Unfolding Manhattan Towers 1 (2008)
Mirela Damian A, Robin Flatl, Joseph O’rourke C
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The...
Abstract Unfolding Manhattan Towers (2008)
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls in a particular shape class we call Manhattan Towers, to a planar simple orthogonal polygon. The algorithm...
Linear Reconfiguration of Cube-Style Modular Robots (2008)
Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatl, Suneeta Ramaswami, ...
Abstract. In this paper we propose a novel algorithm that, given a source robot S and a target robot T, reconfigures S into T. Both S and T are robots composed of n atoms arranged in 2 × 2 × 2...
Curves in the Sand: Algorithmic Drawing (2008)
Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Dania El-khechen, Robin Flatl, ...
Ethnomathematics is the study of mathematics in the works of art of various cultures [3, 4, 10, 14]. The concepts in this
Grid Vertex-Unfolding Orthogonal Polyhedra (2006)
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid...
Grid Vertex-Unfolding Orthogonal Polyhedra (2006)
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid...
Epsilon-Unfolding Orthogonal Polyhedra
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long...