6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.CG2017
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density
Sándor P. Fekete, Sebastian Morr, Christian Scheffer
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be -…
cs.CG2015★ 6 cited
Exact Minkowski Sums of Polygons With Holes
Alon Baram, Efi Fogel, Michael Hemmer +2
We present an efficient algorithm that computes the Minkowski sum of two polygons, which may have holes. The new algorithm is based on the convolution approach. Its efficiency stem…