Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site srcsip.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!stolaf!umn-cs!mmm!srcsip!meier
From: meier@srcsip.UUCP (Christopher M. Meier)
Newsgroups: net.graphics,net.wanted.sources
Subject: Re: Re: fast sphere algorithms (really ref info)
Message-ID: <2186@srcsip.UUCP>
Date: Fri, 15-Nov-85 10:47:33 EST
Article-I.D.: srcsip.2186
Posted: Fri Nov 15 10:47:33 1985
Date-Received: Mon, 18-Nov-85 06:45:03 EST
References: <1490@uwmacc.UUCP> <629@osu-eddie.UUCP> <491@sbcs.UUCP> <2503@mnetor.UUCP> <1651@qubix.UUCP>
Reply-To: meier@srcsip.UUCP (Christopher M. Meier)
Organization: Honeywell SRC (SIP), Mpls MN
Lines: 21
Xref: watmath net.graphics:1275 net.wanted.sources:1533

In article <1651@qubix.UUCP> jeff@qubix.UUCP (Jeff Bulf) writes:
>> >A reasonable way of generating spherical surfaces by purely integer means
>> >...
>> Could somebody post Bresenham's algorithm or provide a journal reference?
>
>1. A Linear Algorithm for Incremental Digital Display of Circular Arcs
>   Jack Bresenham, CACM Feb 1977 Volume 20 Number 2.
>   [this is the horse's mouth, but hard to read]
>
>2. Foley & vanDam contains the most readable presentation I have found.
>   Look under "scan conversion - circles" in the index.
In the last month or two I have noticed that most requests for algorithm
sources could be satisfied by looking in Foley & van Dam's.  May I suggest
that a net.graphics 'newreader' article be posted monthly?  It should (at
least) contain the name of Foley & van Dam's, with a note that most often
asked for algorithms are in it.  Any other good general sources should also
be listed.  Anyone else agree?

Christopher Meier		{ihnp4!umn-cs,philabs}!srcsip!meier
Honeywell S&RC
S&IP AI/T