Path: csiph.com!feeder.erje.net!2.us.feeder.erje.net!nntp.club.cc.cmu.edu!micro-heart-of-gold.mit.edu!bloom-beacon.mit.edu!bloom-beacon.mit.edu!panix!panix.com!forkosh From: JohnF Newsgroups: comp.lang.postscript Subject: Re: hypercube rotations Date: Fri, 24 Jun 2016 04:28:55 +0000 (UTC) Organization: PANIX Public Access Internet and UNIX, NYC Lines: 26 Message-ID: References: <46e56073-6c7b-416e-8733-a2fe836c3a71@googlegroups.com> NNTP-Posting-Host: panix3.panix.com X-Trace: reader1.panix.com 1466742535 15586 166.84.1.3 (24 Jun 2016 04:28:55 GMT) X-Complaints-To: abuse@panix.com NNTP-Posting-Date: Fri, 24 Jun 2016 04:28:55 +0000 (UTC) User-Agent: tin/1.6.2-20030910 ("Pabbay") (UNIX) (NetBSD/6.1.5 (i386)) Xref: csiph.com comp.lang.postscript:2672 luser droog wrote: > On Monday, June 20, 2016 at 2:34:08 PM UTC-5, luser droog wrote: >> http://codegolf.stackexchange.com/a/83318/2381 > > I've wanted to write this program ever since reading Rudy Rucker > and P.D. Ouspensky, and A.K. Dewdney. For review, here's a very > nice paper I just found about the wonders of rotation matrices: > > http://www.fastgraph.com/makegames/3drotation/ > > I've reduced the golfed version to 683 chars, using the > binary-token-strings from my golf library, and abbreviated > system names for stuff that would be longer in a binary-token- > string. The rotations are the prime candidate for further > reductions, but none of the other answers have solved that > yet either! :) In addition to your fastgraph.com link above, I found http://paulbourke.net/geometry/rotate/ very useful when I programmed this stuff in C. It's a bit more "cookbook", and it also (though briefly) discusses quaternions (which I agree is likely the better approach, though, at least for me, harder to intuitively see how it's working). -- John Forkosh ( mailto: j@f.com where j=john and f=forkosh )