3 citations · 3 across the 5 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2021
Online Sorting and Translational Packing of Convex Polygons
Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta +1
We investigate several online packing problems in which convex polygons arrive one by one and have to be placed irrevocably into a container, while the aim is to minimize the used…
cs.CG2021
Online Packing to Minimize Area or Perimeter
Mikkel Abrahamsen, Lorenzo Beretta
We consider online packing problems where we get a stream of axis-parallel rectangles. The rectangles have to be placed in the plane without overlapping, and each rectangle must be…