Skip to main content
1 of 2

Area of an irregular, n-sided, non-intersecting (edges) polygon algorithm

I need to generate a n-sided polygon of non-intersecting edges (n= 200, for example) of with the smallest area possible but I've tried designing a couple of algorithms with no satisfying result. Is there something out there with this specifications or a way of designing it? I have OpenGL if it helps.