I need to generate an irregular, n-sided polygon of non-intersecting edges (n= 200, for example) with the smallest area possible. The position of the vertex is random and 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.
Area of an irregular, n-sided, non-intersecting (edges) polygon algorithm
Kolt Penny
- 21
- 2