Gudmundsson, Joachim - 2018
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, into rectangles, and show an Ω( log ) lower bound on the time-complexity. The result holds for any decomposition,...