Covering and Partitioning Complex Objects with Small Pieces

Anders Aamand, Mikkel Abrahamsen, Reilly Browne +6

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contain…