8 citations · 36 across the 49 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2017
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Erik D. Demaine, Matias Korman, Jason S. Ku +6
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union…
cs.CG2014★ 3 cited
A lower bound on opaque sets
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi +1
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This…