Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site sbcs.UUCP Path: utzoo!linus!philabs!sbcs!rick1 From: rick1@sbcs.UUCP (Guest account) Newsgroups: net.graphics,net.wanted.sources Subject: Re: Re: fast sphere algorithms Message-ID: <491@sbcs.UUCP> Date: Fri, 25-Oct-85 20:26:43 EST Article-I.D.: sbcs.491 Posted: Fri Oct 25 20:26:43 1985 Date-Received: Thu, 31-Oct-85 04:01:33 EST References: <1490@uwmacc.UUCP> <629@osu-eddie.UUCP> Organization: Computer Science Dept, SUNY@Stony Brook Lines: 11 Xref: linus net.graphics:1181 net.wanted.sources:1462 *** Zing Wow Dwoop! *** A reasonable way of generating spherical surfaces by purely integer means is, of course, to run two bresenham's circle algorithms in tandem (or has someone already mentioned this). Doing things this way is nice since it lends itself to scanline hidden surface removal and shading (it even runs local on a dmd 5620). Perry S. Kivolowitz ihnp4!atux01!perry