3 papers
cs.CG2022
How Fast Can We Play Tetris Greedily With Rectangular Pieces?
Justin Dallant, John Iacono
Consider a variant of Tetris played on a board of width and infinite height, where the pieces are axis-aligned rectangles of arbitrary integer dimensions, the pieces can only b…
cs.CG2021
Approximability of (Simultaneous) Class Cover for Boxes
Jean Cardinal, Justin Dallant, John Iacono
Bereg et al. (2012) introduced the Boxes Class Cover problem, which has its roots in classification and clustering applications: Given a set of n points in the plane, each colored…
cs.CG2020
Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner -theorem
Justin Dallant, Patrick Schnider
Hadwiger and Debrunner showed that for families of convex sets in with the property that among any of them some have a common point, the whole family can be…