Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 (Tek) 9/28/84 based on 9/17/84; site pogo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!bellcore!decvax!tektronix!orca!pogo!jutz
From: jutz@pogo.UUCP (Curt Jutzi)
Newsgroups: net.graphics
Subject: Re: Circle Algorithm?
Message-ID: <2371@pogo.UUCP>
Date: Mon, 3-Feb-86 12:02:33 EST
Article-I.D.: pogo.2371
Posted: Mon Feb  3 12:02:33 1986
Date-Received: Wed, 5-Feb-86 01:48:33 EST
References: <8300031@uiucdcsb>
Reply-To: jutz@pogo.UUCP (Curt Jutzi)
Organization: Tektronix, Beaverton OR
Lines: 24

In article <8300031@uiucdcsb> robison@uiucdcsb.CS.UIUC.EDU writes:
>Within the last 10 years I saw a paper on a circle drawing algorithm
>which was similar to Bresenham's, but drew more accurate circles.   
>It was based on drawing contour lines for a paraboloid.
>I think the article was in one of the IEEE magazines.


	There was a very good algorithm in IEEE Transactions on computers
	VOL C-22 No. 12 December 1973, entitled "An Im proved Algorithm
	for the Generation of Nonparametric Curves" by Bernard Jordan, 
	William Lennon, and Barry Holm.


	Curtis Jutzi

________________________________________________________________________

	tektronix!pogo!jutz
	tektronix!gpp1!golem!jutz

	(503) 685-3722
	P.O. Box 1000
	Wilsonville, OR 97070
________________________________________________________________________