20 citations · 44 across the 25 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CG2011
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm
Mirela Damian, Erik Demaine, Robin Flatland
We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previo…
cs.CG2011
Undirected Connectivity of Sparse Yao Graphs
Mirela Damian, Abhaykumar Kumbhar
Given a finite set S of points in the plane and a real value d > 0, the d-radius disk graph G^d contains all edges connecting pairs of points in S that are within distance d of eac…