8 citations · 18 across the 3 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2016
Incremental Voronoi Diagrams
Sarah R. Allen, Luis Barba, John Iacono +1
We study the amortized number of combinatorial changes (edge insertions and removals) needed to update the graph structure of the Voronoi diagram (and several vari…
cs.CG2012★ 5 cited
Packing identical simple polygons is NP-hard
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…