Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site gcc-bill.ARPA
Path: utzoo!linus!philabs!cmcl2!seismo!harvard!gcc-bill!brad
From: brad@gcc-bill.ARPA (Brad Parker)
Newsgroups: net.graphics
Subject: Re: Dvorak and SIGGRAPH (rather long)
Message-ID: <276@gcc-bill.ARPA>
Date: Fri, 2-Aug-85 10:18:27 EDT
Article-I.D.: gcc-bill.276
Posted: Fri Aug  2 10:18:27 1985
Date-Received: Sat, 3-Aug-85 21:01:18 EDT
References: <1063@dual.UUCP> <1723@saber.UUCP>
Reply-To: brad@gcc-bill.UUCP (Brad Parker)
Distribution: net
Organization: General Computer Company, Cambridge Ma (Home of the HyperDrive)
Lines: 25

I've been reading InfoWorld long enought to take anything Good 'ol John
writes with a shot of tequila.

But this is really neat:

In article <1723@saber.UUCP> skinner@saber.UUCP (Robert Skinner) writes:
>
>... a ray-tracing algorithm
>that executes in constant time ( same time for 5 polygons as for 50,000 ) 
>(so what if the program is available commercially, the speaker gave us
>enough information to duplicate that performance);

I read about the commercial program. I didn't know it was to be
discussed at SigGraph. I guess I'll buy the course notes now.

Could someone give a brief description of the process? (octtrees?)

"My God, those clouds look just like fractals!"
-- 

J Bradford Parker
uucp: seismo!harvard!gcc-bill!brad

"She said you know how to spell AUDACIOUSLY? I could tell I was in love...
You want to go to heaven? or would you rather not be saved?" - Lloyd Coal