Let P be a multiply connected polygonal domain with holes (possibly de
generate) and let F be a certain family of directions in the plane. We
give a formula for the minimum number of convex pieces in which P is
partitioned with the help of guillotine cuts along the directions of F
.