TheSwamp

Code Red => AutoLISP (Vanilla / Visual) => Topic started by: domenicomaria on March 01, 2021, 04:39:36 PM

Title: algorithm to calculate n-sided polygon shape
Post by: domenicomaria on March 01, 2021, 04:39:36 PM

I'm looking for an algorithm that solves the following problem:
given an n-sided polygon,
of which the measure of some sides and the measure of some diagonals are known.

The diagonals never intersect the sides.

This algorithm should first of all check whether the number
of the known measures is insufficient, exact or overabundant.

In case the number of measurements is exact, it must calculate the shape of the polygon.

In the event that the number of measures is overabundant, he must calculate the shape of the polygon, in all possible ways.


Is there anyone who can tell me something?

Title: Re: algorithm to calculate n-sided polygon shape
Post by: BIGAL on March 01, 2021, 08:19:30 PM

Is this a soccer ball or similar ? There is lots of theory out there sounds like what your after a similar object.