Re: n-poly from a line...

Op 30/03/2025 om 08:24 schreef Chris M. Thomasson:

Well, according to some AI's, lol, my ability to find an n-poly from a single line, its incircle, outcircle and center point is supposedly something good. Some of them claim it's not enough info to gain the poly from the line and number of vertices alone. Well, my function only takes two points (p0, p1) and a number of vertices (n) for the result. Then renders all of them. Does this sound like anything worthwhile to you? I just did it for a new fractal I am tinkering around with for fun. I did not think it was anything all that special. Fwiw, here is a render:
 https://i.ibb.co/Y7G4C80t/image.png
 Notice how the red circles are all tangent along a "path". The green circles intersect. The number of polys are decreased as they extend out. This starts from a single line and the number of vertices. I am thinking about doing something interesting with it. It might look fairly nice.
 :^)
 Thanks.
 Kind of interesting at all? Or been there, done that. :^)

Nice! Looks a bit like a polyhedron that has been unfolded.
Not sure how you scaled it relative to the unit circle.
https://www.desmos.com/calculator/3izjfv3yma