CP2060 - Lecture 10 - Graphics Primitives 2

 

 

Notes on Graphics Primitives are here. We will go through some of these each time we talk about primitives.

In this lecture we covered the following:

  • Midpoint (Bresenham's) algorithm to scan converting circles (nodes 5 - 9)
  • Area filling for rectangles and polygons (nodes 11 - 13)

Some notes were covered in less detail, but there is more in the notes for you to read about - e.g. the mathematical basis of some of the algorithms, like midpoint.

  

 

 Announcements

Lecture notes are provided as a guide of the content of lectures for pre-reading, revision and for students who cannot attend lectures. While almost every effort is made to make the online notes as complete as possible, there is always material discussed in lectures that is not in the notes.
You should not rely on these notes only!
If you miss a lecture and you do not understand something in the notes, you should consult (in this order) other students, the tutors, or the lecturer to try to work it out.

You are expected to read these lecture notes as well as attending lectures, as vital information is contained in both.

 

 Subject Coordinator: Lindsay {w} | {e}.

Last Update: September 4, 2001