Showing cs.CGShow all
3 papers · 1 filter
cs.CG2024
Partitioning a Polygon Into Small Pieces
Mikkel Abrahamsen, Nichlas Langhoff Rasmussen
We study the problem of partitioning a given simple polygon into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for const…
cs.CG2024
Framework for -Completeness of Two-Dimensional Packing Problems
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be h…
cs.CG2024
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…