On partitioning polygons

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

[1]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[2]  H. Djidjev.  On the Problem of Partitioning Planar Graphs , 1982 .

[3]  Frank Harary,et al.  Graph Theory , 2016 .

[4]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  Kurt Mehlhorn,et al.  Fast Triangulation of Simple Polygons , 1983, FCT.

[6]  Robert E. Tarjan,et al.  Application of a Planar Separator Theorem , 1977, FOCS.