delorie.com/archives/browse.cgi | search |
From: | David Jenkins <me AT jenkinsdavid DOT demon DOT co DOT uk> |
Newsgroups: | rec.games.programmer,comp.os.msdos.djgpp |
Subject: | Re: bresenham's circle |
Date: | Fri, 1 Aug 1997 03:06:11 +0100 |
Organization: | None |
Distribution: | world |
Message-ID: | <vMFk6FATSU4zEwx$@jenkinsdavid.demon.co.uk> |
References: | <33DF4527 DOT 671 AT mindspring DOT com> |
<kn5WwGAfZ$3zEwbB AT jenkinsdavid DOT demon DOT co DOT uk> <33E06240 DOT 3FE7 AT mindspring DOT com> | |
NNTP-Posting-Host: | jenkinsdavid.demon.co.uk |
MIME-Version: | 1.0 |
Lines: | 18 |
To: | djgpp AT delorie DOT com |
DJ-Gateway: | from newsgroup comp.os.msdos.djgpp |
In article <33E06240 DOT 3FE7 AT mindspring DOT com>, Derek Greene <topcoder AT mindspring DOT com> writes >David Jenkins wrote: >> Is this Bresenhams circle routine?? >> Or is it the one where you calculate an eigth of a circle and draw the >> full circle from these calcs, never seen that one in action though. > >according to my info, bresenham's is the one where you calculate the >eighth Is it faster than the routine I posted?? I did read about it somewhere, I figured that recalculating the eigth to the other 7 eigths would take offset the benefits. -- http://www.jenkinsdavid.demon.co.uk for C programmers. David Jenkins
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |