Circle Drawing Homework
			     Due, 9/23/04

			Hardcopy by the end of class
		(No late will be accepted.   If I do NOT have
		your submission in hand by the time I leave
		class on 9/23/04, then the grade is zero.)

The objective of this homework is for you to implement two
basic circle algorithms and compare their performance.  (Similar
work was done for the line in the on-line notes presented during
the 1st week of classes and you may wish to refer to these,
with the pointer on my website being "Nice-MIT-graphics-site".) 

1. Implement a circle drawing algorithm based upon approximating
the circle by multiple line segments.

2. Implement the Bresenham circle drawing algorithm.
Good reference sites are posted, below. 
	
3. Take care to make sure both implementations deliver comparable
quality images over a wide range of input values.

4. Compare the performance of the two implementations.

5. Discuss any differences in performance.

Hand in :

A. A summary of your performance comparison, presenting the final results,
a brief explanation at how you arrived at them, any discrepancies experienced
and your final conclusion.

B. Justify your conclusion, based upon your observations.
Cite any sources you used, including those below.

What you hand in should be no more than 1 page.

Good sites:

http://www.netnam.vn/unescocourse/computervision/63.htm
http://alamos.math.arizona.edu/535/resources/Lec02_Bresenham.pdf
http://www.rpi.edu/dept/ecse/graphics-f99/Classes/24/

(For various systems failings, I copied these by hand, so be
warned that there is some risk of minor typos.)