On partitioning polygons
Andrzej Lingas · 1985
Chaselle has shown how to partition any simple polygon P into two polygons, each of total weight not greater than two thirds of the total weight of P, by drawing a diagonal within P. Under the assumption that a triangulation of P is given, we provide a straightforward proof of Chaselles theorem and derive generalizations of the theorem to include polygons with polygonal holes.