182 citations · 549 across the 43 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.CG2006★ 8 cited
Locked and Unlocked Chains of Planar Shapes
Robert Connelly, Erik D. Demaine, Martin L. Demaine +5
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonover…
cs.CG2006★ 182 cited
Minimum-weight triangulation is NP-hard
Wolfgang Mulzer, Guenter Rote
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulat…