I have some x and y coordinates that make a convex polygon. I need to connect 2 of these coordinates such that they cut the polygon into 2 new polygons and the respective areas of these 2 polygons formed have the smallest difference possible ...

I have managed to write an algorithm that calculates the whole area of the original polygon (without using the triangulation method) but I don't know if that helps and moreover I don't know how to proceed.

Does anyone have any idea what's the next step or what's the algorithm I should use?