5 citations · 25 across the 22 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2022★ 1 cited
Reconfiguration of Non-crossing Spanning Trees
Oswin Aichholzer, Brad Ballinger, Therese Biedl +7
For a set of points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pa…
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…