1 paper
Mikkel Abrahamsen, Nichlas Langhoff Rasmussen
We study the problem of partitioning a given simple polygon P into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for const…