1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CG2026
Overlapping Unfoldings of Cones and Convex Polyhedra
MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine +4
Research on Dürer's problem focuses on edge unfoldings of convex polyhedra that avoid overlap. We invert the goal and find unfoldings that overlap at some point to any given thickn…
cs.CG2019★ 1 cited
Some Polycubes Have No Edge Zipper Unfolding
Erik D. Demaine, Martin L. Demaine, David Eppstein +1
It is unknown whether every polycube (polyhedron constructed by gluing cubes face-to-face) has an edge unfolding, that is, cuts along edges of the cubes that unfolds the polycube t…