3 papers
cs.CG2021
Packing d-dimensional balls into a d+1-dimensional container
Helmut Alt, Sergio Cabello, Otfried Cheong +2
In this article, we consider the problems of finding in dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex b…
cs.CG2020
Plane Spanning Trees in Edge-Colored Simple Drawings of
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus +5
Károlyi, Pach, and Tóth proved that every 2-edge-colored straight-line drawing of the complete graph contains a monochromatic plane spanning tree. It is open if this statement gene…
cs.CG2020
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…