On the equipartition of plane convex bodies and convex polygons (Q811820)

The main theorem considers dissecting a planar convex body \(C\) by its \(m\) non-crossing chords into parts of equal areas. Of course, in the special case when \(C\) is a triangle and \(m=3\), we get the only solution taking the three chords connecting the midpoints of the sides. The authors prove that in every other case, the boundary of each part contains at most two of the \(m\) chords, i.e., that the dual tree of the partition is a path. Another theorem concerns dissecting a convex polygon into parts of equal areas by chords having a common interior point.