cvs.gedasymbols.org/archives/browse.cgi   search  
Mail Archives: djgpp/1997/02/06/13:08:24

From: peuha AT cc DOT helsinki DOT fi (Esa A E Peuha)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: ellipses at an angle
Date: 6 Feb 1997 14:32:53 GMT
Organization: University of Helsinki
Lines: 19
Message-ID: <5dcq2l$qkm@oravannahka.Helsinki.FI>
References: <5d098v$b00 AT nr1 DOT ottawa DOT istar DOT net> <5d7ihn$e1e AT wapping DOT ecs DOT soton DOT ac DOT uk>
NNTP-Posting-Host: kruuna-ether.helsinki.fi
Mime-Version: 1.0
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp

Adrian Smith (ams94 AT ecs DOT soton DOT ac DOT uk) wrote:

: Hi, I think if you use Bresenham's algorithm, or the midpoint algorithm (which
: are similar), you should be able to do it.  That can certainly draw straight
: lines and circles.

What exactly do you refer to with "Bresenham's algorithm"? There are
things called the Bresenham line algorithm and the Bresenham circle
algorithm, which are used to draw lines and circles, respectively.
These are rather ingeniously derived algorithms which only use integer
addition and multiplication by constants, so they are fast and easy to
program. However, these can *only* draw lines and circles, and so are
improper answer to question of drawing ellipses. (I could post info
about how to derive these algorithms, if anyone is interested.)

--
Esa Peuha
student of mathematics at the University of Helsinki
http://www.helsinki.fi/~peuha/

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019