Path: utzoo!utgpu!attcan!uunet!cs.utexas.edu!rutgers!rochester!rit!ultb!lmb7421
From: lmb7421@ultb.UUCP (L.M. Barstow)
Newsgroups: comp.sys.apple
Subject: Re: 3-D vector graphics in assembly
Message-ID: <722@ultb.UUCP>
Date: 21 Apr 89 17:56:15 GMT
References: <23400@agate.BERKELEY.EDU>
Reply-To: lmb7421@ultb.UUCP (L.M. Barstow (674SPS))
Organization: Rochester Institute of Technology, Information Systems
Lines: 24

In article <23400@agate.BERKELEY.EDU> labc-3dc@web-4b.berkeley.edu (Andy McFadden) writes:
>Question is, does anybody have source/object/vague general notions of
>how to do 3-D transformations in assembly language?
>
>I have a couple of old Nibble magazines, but those requires some transcen-
>dental functions and square roots (the latter of which is not well handled
>in the GS toolbox... +/- 3...).  Is there a better/faster way?
>
How about taking the transcendentals and changing them into series
expansions...then all you have to do is run about 3-4 terms of the
series expansion through the computer (something that, if programmed
with care, can be done without too much reliance on SANE)

I make no claims on the ability of this method, as I have never actually
programmed it, but it should be faster than using SANE.  Using tricks
like multiplying by bit-shifting, and storing polynomials in
bit-patterns, you should be able to create some fairly fast code.


-- 
Les Barstow     LMB7421@RITVAX.BITNET
...rutgers!rochester!ritcv!ultb!lmb7421.UUCP
"I know you think you know what you thought I said, but
you don't realize that what you thought I said was not what I meant"