1 citations · 2 across the 5 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2021
Snipperclips: Cutting Tools into Desired Polygons using Themselves
Zachary Abel, Hugo Akitaya, Man-Kwun Chiu +7
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e…
cs.CG2014
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…
cs.CG2009★ 1 cited
Continuous Blooming of Convex Polyhedra
Erik D. Demaine, Martin L. Demaine, Vi Hart +3
We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can b…