input: N pairs of x and y point coordinates

- points are connected with lines in given order, last is connected to first
- points may have doubles: points with different index may have same coordinates
- points may have z coord, but for this puzzle they should belong to same plane (i’m not sure how to extend this puzzle into 3d)

output: arrays of points that make polygons which original polygon consists of

p1x1,p1y1 … p1xN,p1yN

…

pMx1,pMy1 … pMxN,pMyN

- N in answer is unique for every line and can be equal to 3 or larger, according to number of points in Mth result polygon
- result polygons should have no internal crossings
- result polygons should not overlap
- visualise the result?

@CvxFous inb4 “is this homework”: yes

what is linear programming (it is not a programming): https://en.wikipedia.org/wiki/Linear_programming