Computer Graphics

Theo D'Hondt
Programming Technology Lab - Computer Science Department
Faculty of Sciences
Vrije Universiteit Brussel 


Introduction

Objectives

Schedule

Reading

Notes

Software

Test

Contacts

 

WHAT?

This course ( Grafische Systemen ) is part of the computer science curriculum organised by the computer science department of the faculty of sciences of the Vrije Universiteit Brussel. It is a course (first issue in the academic year 1996/1997) organised under the responsibility of Theo D'Hondt. The course is not intended to cover the entire field of computer graphics; rather, it focuses on computational geometry

WHO?

This is an optional course for the following sections:
2de jaar Licentiaat in de Natuurkunde Technologische en Toegepaste Natuurkunde
1ste jaar Licentiaat in de Informatica
2de jaar Licentiaat in de Informatica
Master na Master of Computer Science
1ste jaar Licentiaat in de Wiskunde

This course may also be selected by various special programs:

Master in Applied Computer Science
1ste jaar Licentiaat in de Geografie Geografische Informatiesystemen
2de jaar Licentiaat in de Geografie Geografische Informatiesystemen

Prerequisites are: basic mathematical, algorithmic and programming skills.

Tutorials and recitations are in DUTCH.

WHEN?

The course is organised as 12 2-hour tutorials and 12 2-hour recitations. A tutorial is a lecture on some fundamental issue in the subject field of computer graphics; it is backed by lecture notes and assigned reading material. A recitation is a hands-on lab session involving a practical assignment.

HOW?

Both the tutorials and recitations are scheduled in the first semester. We will be using the language C (to a lesser extent) and a graphical extension of Pico (as a kind of pseudo code) to specify the various geometrical algorithms and to execute assignments during recitations (see the software section) . The objective is to establish a generic expertise in the algorithmic concepts that underlie many computer graphics processes and systems. A fairly recently published monograph on computational geometry (see the reading section) will be used as a broad guideline for exploring the various algorithms.