CS 7160 – Software Development in Computer Graphics I

Spring Semester, 2002

COURSE DESCRIPTION:

This course presents an in-depth introduction to state-of-the-art interactive computer graphics algorithms, with special emphasis on the GKS standard. 2-D and 3D viewing, clipping and geometric modeling will be studied. Raster extensions and mathematical algorithms will be presented.

Prerequisites:

1- Proficiency in a high level language
(C, C++, etc.)

2- Algorithms ^and/_or Data Structures, Systems Programming

3- Working knowledge of Linear Algebra, a plus

GENERAL OBJECTIVES:

This course is designed to exercise the students previous experience in computer science, utilizing numerical methods, algorithms and data structures, while stressing the importance of standards within the computer industry. The student will write a graphics package, based on the current GKS standard, writing all the low level algorithms, organized and modularized according to recognized programming practices.

COURSE GRADING:

1- Homework Programming Assignments - 60% of grade

2- Mid-term Project - 20% of grade

3- FINAL project - 20% of grade

Assignments will be graded on the basis of:

1- They accomplish the assigned tasks.

2- They are turned in ON TIME. Points will be deducted

for lateness.

1 week late -20 points

2 weeks late -30 points

not accepted any later then that

3- They are BEAUTIFULLY and ACCURATELY DOCUMENTED.

4- Cheating is cause for immediate dismissal.

ATTENDANCE:

Required

COURSE OUTLINE:

DAY1 Welcome, discussion of class, requirements, standards

DAY2 Bresenham's algorithm

DAY3 Sierpinski Curves

DAY4 GKS functions

DAY5 Coordinate System Transformations

DAY6 Windows and Viewports

DAY7 Polyline, Sierpinski

DAY8 Clipping, Liang-Barsky vs Cohen-Sutherland

DAY9 Midterm Project

DAY10 Lineprinter as output device

DAY11 Scale transformations

DAY12 Rotate transformations

DAY13 Translate transformations

DAY14 Final integration

DAY15 Final Projects due