Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/5/84; site mnetor.UUCP Path: utzoo!utcs!mnetor!george From: george@mnetor.UUCP (George Hart) Newsgroups: net.graphics,net.wanted.sources Subject: Re: Re: fast sphere algorithms Message-ID: <2503@mnetor.UUCP> Date: Thu, 31-Oct-85 08:12:12 EST Article-I.D.: mnetor.2503 Posted: Thu Oct 31 08:12:12 1985 Date-Received: Thu, 31-Oct-85 09:37:03 EST References: <1490@uwmacc.UUCP> <629@osu-eddie.UUCP> <491@sbcs.UUCP> Reply-To: george@mnetor.UUCP (George Hart) Organization: Computer X (CANADA) Ltd., Toronto, Ontario, Canada Lines: 19 Xref: utcs net.graphics:1232 net.wanted.sources:1498 In article <491@sbcs.UUCP> rick1@sbcs.UUCP (Guest account) writes: > >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). > > Perry S. Kivolowitz Could somebody post Bresenham's algorithm or provide a journal reference? Much appreciated... -- Regards, George Hart, Computer X Canada Ltd. UUCP: {allegra|decvax|duke|floyd|linus|ihnp4}!utzoo!mnetor!george BELL: (416)475-8980