26 citations · 41 across the 10 of their papers we have counts for
6 papers · 1 filter
Band Unfoldings and Prismatoids: A Counterexample
Joseph O'Rourke
This note shows that the hope expressed in [ADL+07]--that the new algorithm for edge-unfolding any polyhedral band without overlap might lead to an algorithm for unfolding any pris…
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 Restricted Convex Caps
Joseph O'Rourke
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restric…
Unfolding Orthogonal Terrains
Joseph O'Rourke
It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its…
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…