A colleague of mine just told me this amusing optimization problem:
Given an equilateral triangle, cut it into two pieces of the same size with a curve of minimal length.
I only want some insight or hint that might help me solve this. I am thinking that this must be related to circle arcs, for instance I computed that the length of the circle arc (centered at one vertex) is shorter than just cutting in a straight line through that vertex.
Any reference or hint, or clever solution will be appreciated.