Xref: utzoo comp.graphics:15558 comp.sys.ibm.pc.misc:5835
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!sdd.hp.com!decwrl!mcnc!borg!homer!leech
From: leech@homer.cs.unc.edu (Jonathan Leech)
Newsgroups: comp.graphics,comp.sys.ibm.pc.misc
Subject: Re: General Ellipse-arc drawing algorithm
Keywords: Curve ellipse arc
Message-ID: <813@borg.cs.unc.edu>
Date: 25 Jan 91 03:04:50 GMT
References: < <1991Jan23.095200.17536@cavebbs.gen.nz> <279F954C.4186@orion.oac.uci.edu>
Sender: news@cs.unc.edu
Reply-To: leech@homer.cs.unc.edu (Jonathan Leech)
Followup-To: comp.graphics
Organization: University of North Carolina, Chapel Hill
Lines: 14

In article <279F954C.4186@orion.oac.uci.edu>, fleming@ (Dennis Fleming) writes:
|>Pitteway has a routine for incrementally plotting arbitrary conic sections.
|>That algorithm along with other similar curve drawing routines can be
|>found in _Fundamental Algorithms for Computer Graphics_ ed. R.A. Earnshaw
|>Springer-Verlag 1985.  It is part of the NATO ASI series F volume 17.
|>It is, however, probably overpriced

	And perhaps not needed, if you have access to a moderately well-stocked
CS library. Look in _Computer Journal_, V10 (1967-68), pg. 282 for
"Algorithm for drawing ellipses or hyperbolae with a digital plotter"
by M. Pitteway.
	Jon (leech@cs.unc.edu)
	__@/