I have a list/array of 2D points which form a non-convex non-self-intersecting shape. I want to calculate the area enclosed by that polygon.
First I need to form a polygon with the points that I get provided as a 'curve-walk' (non self intersecting). If I can triangulate that polygon I can calculate the area ( I can tolerate a small relative error).
Using scipy's scipy.spatial.ConvexHull()
results in the wrong shape and area , obviously, but I have not found a available algorithm in the big math packages which does this.
Can anyone tell me how to do that ?