1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CG2026
A 2.37332-Competitive Algorithm for Online Square Packing with Gravity
Nichlas Langhoff Rasmussen
We consider online packing of axis-parallel squares into a unit-width strip under the Tetris and gravity constraints: An incoming square must be lowered from above along a monotoni…
cs.CG2022★ 1 cited
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…