52 citations · 271 across the 48 of their papers we have counts for
4 papers · 1 filter
Zig-Zag Numberlink is NP-Complete
Aaron Adcock, Erik D. Demaine, Martin L. Demaine +4
When can terminal pairs in an grid be connected by vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our ha…
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Zachary Abel, Erik D. Demaine, Martin L. Demaine +3
When can a plane graph with prescribed edge lengths and prescribed angles (from among \}) be folded flat to lie in an infinitesimally thin line, without c…
Covering Folded Shapes
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine +6
Can folding a piece of paper flat make it larger? We explore whether a shape must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary f…
Fun with Fonts: Algorithmic Typography
Erik D. Demaine, Martin L. Demaine
Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general publi…