18 citations · 72 across the 35 of their papers we have counts for
1 paper · 2 filters
Sarah R. Allen, John Iacono
Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rot…