| Deutsch English Français Italiano |
|
<vshgdb$3tnbb$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> Newsgroups: sci.math Subject: Re: n-poly from a line... Date: Tue, 1 Apr 2025 12:56:27 -0700 Organization: A noiseless patient Spider Lines: 102 Message-ID: <vshgdb$3tnbb$1@dont-email.me> References: <vsao2f$3cs3g$1@dont-email.me> <vse619$cohc$1@dont-email.me> <vsf03h$17pu0$1@dont-email.me> <vsf6co$1fk8s$1@dont-email.me> <vsfr7f$2852l$1@dont-email.me> <vsfri3$2852l$2@dont-email.me> <vsgg5u$2tnlc$1@dont-email.me> <vshfnm$3smrc$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Tue, 01 Apr 2025 21:56:28 +0200 (CEST) Injection-Info: dont-email.me; posting-host="6a28caa622631622252af857ca6212f6"; logging-data="4119915"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/MsgV2IISVv5yzWPQIp0O0OULJASlbwY4=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:N18c3t06iD4BH701WN2jmw2AWo8= Content-Language: en-US In-Reply-To: <vshfnm$3smrc$2@dont-email.me> On 4/1/2025 12:44 PM, Chris M. Thomasson wrote: > On 4/1/2025 3:46 AM, sobriquet wrote: >> Op 01/04/2025 om 06:54 schreef Chris M. Thomasson: >>> On 3/31/2025 9:48 PM, Chris M. Thomasson wrote: >>>> On 3/31/2025 3:53 PM, sobriquet wrote: >>>>> Op 31/03/2025 om 23:05 schreef Chris M. Thomasson: >>>>>> On 3/31/2025 6:40 AM, sobriquet wrote: >>>>>>> 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 >>>>>> >>>>>> Thanks. Well, my algorithm starts off with only three relevant >>>>>> inputs: >>>>>> >>>>>> p0 = start of line >>>>>> p1 = end of line >>>>>> n = the n in n-poly >>>>>> >>>>>> From that information alone, I create the fractal. So, it's not >>>>>> scaled to the unit circle, its basically scaled from that line >>>>>> (p0, p1). So, it can grow out of bounds, if we treat the unit >>>>>> circle as a sort of "boundary". Now, you read my mind a bit. I >>>>>> have a way to scale the fractal as a whole inside of any circle. >>>>>> Just need to port my older code to this. Fwiw, these types of >>>>>> things can get pretty dense, using the tangent circles instead of >>>>>> n-poly. Actually, its a different generator algo using the same >>>>>> intersection avoidance algo: >>>>>> >>>>>> https://www.facebook.com/photo? >>>>>> fbid=1377765076715820&set=pcb.1377765353382459 >>>>>> >>>>>> Can you get to that FB link? Sorry... ;^o >>>>> >>>>> Yes, looks cool.. Can you also shade those fractals? >>>>> >>>>> In desmos it's a bit cumbersome, but still kinda cool effect: >>>>> >>>>> https://www.desmos.com/calculator/kuw9d9ftim >>>>> >>>> >>>> I got it in 3d now. Here is an example: >>>> >>>> https://i.ibb.co/CkHZ98P/ct-p4-Copy.png >>> >>> https://www.facebook.com/photo/? >>> fbid=1378008770024784&set=pcb.1378008916691436 >>> >> >> Would be nice if you can zoom and view it from all sides. But I guess >> you can put it on sketchfab for an interactive version. >> >> https://www.desmos.com/3d/0oepmeegkq > > Right now, my port to 3d is only using the z-axis from that starting > line. So, its confined to that z-axis. Oops! This current sphere experiment of mine is not the same as my n-poly that starts from a single line. This one starts from a single sphere. Sorry for any confusion. ;^o Grrr! > Now, all I need to do is make my > polar projection into a spherical projection and it should build the > cluster in 3d. I will keep you updated. Fwiw, here is what it looks like > when viewed from a different angle: > > https://i.ibb.co/Y7xxdCLz/ct-pov.png > > It's going to look a _lot_ different when I add in that spherical > casting... > > :^)