4 papers
A New Lower Bound on Guard Placement for Wireless Localization
Mirela Damian, Robin Flatland, Joseph O'Rourke +1
The problem of wireless localization asks to place and orient stations in the plane, each of which broadcasts a unique key within a fixed angular range, so that each point in the p…
Connecting Polygonizations via Stretches and Twangs
Mirela Damian, Robin Flatland, Joseph O'Rourke +1
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…
Unfolding Manhattan Towers
Mirela Damian, Robin Flatland, Joseph O'Rourke
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 orthogo…
Grid Vertex-Unfolding Orthogonal Polyhedra
Mirela Damian, Robin Flatland, Joseph O'Rourke
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 addit…