5 citations · 9 across the 6 of their papers we have counts for
7 papers
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…
A fast algorithm for computing irreducible triangulations of closed surfaces in
Suneeta Ramaswami, Marcelo Siqueira
We give a fast algorithm for computing an irreducible triangulation of an oriented, connected, boundaryless, and compact surface in from any given triangulatio…
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…
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
Justin Colannino, Mirela Damian, Ferran Hurtado +4
The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly…
Small Strictly Convex Quadrilateral Meshes of Point Sets
David Bremner, Ferran Hurtado, Suneeta Ramaswami +1
In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we s…