Chop Chop

Limits 1.5s, 256 MB

There is a convex polygon AA%A of nnn vertices and you want to divide it into two convex polygons PPP and QQQ such that their areas are equal (half of AAA) and the sum of perimeters of PPP and QQQ is minimum possible.


This is a companion discussion topic for the original entry at https://toph.co/p/chop-chop