Skip to main content
MathOverflow

Return to Question

added 47 characters in body
Source Link
Kolt Penny
Kolt Penny
  • 21
  • 2

I need to generate aan irregular, n-sided polygon of non-intersecting edges (n= 200, for example) of with the smallest area possible but. 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.

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.

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.

Source Link
Kolt Penny
Kolt Penny
  • 21
  • 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.