Prove that for every n, every polygon (even if it has holes) can be partitioned into n connected pieces of the same area
...it also works with random points
These are the self-intersecting onions @jeffgerickson was mentioning
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!