LeMoyne-Owen College
Division of Natural Science, Mathematics & Computer Science
Office
Hours
Announcements
For course schedule click here: Course
Schedule
COURSE: COSI 440 Computer Graphics, 3 Credit Hours
TEXT:
INTERACTIVE COMPUTER GRAPHICS - A Top-Down Approach Using Open GL by
Edward Angel Third Edition
Addison-Wesley, ISBN 0-201-77343-0 Published in 2003
OpenGL - A Primer by Edward Angel Addison-Wesley ISBN 0-201-74186-5 Published
in 2002
For other text books: Reference
books
Other Materials:
Description of class Graphics from Java Graphics Library
Description of class Polygon from Java Graphics Library
For more details: Edward Angel
on OpenGL: Open GL
On Sgi: SGI
Open GL by Silicon Graphics: Silicon Graphics
CLASS MEETINGS: M W F 8:00 - 8:50, GOH 114
INSTRUCTOR: Dr. Vivek Savur. GOH 100 B Extension. 419 Office Hours
PREREQUISITES: Knowledge of Programming Languages C, C++ and Java
COURSE DESCRIPTION: Review of graphic display architecture and graphic input devices, 2D and 3D transformations and current graphics applications.
OBJECTIVES: To understand computer graphics. To write programs in to draw objects.
Week Textbook Lab manual
1 Graphics Systems and
Models OpenGL API
2
Graphics
Programming
Two-Dimensional Programming in OpenGL
3 Input and
Interaction Interaction and Animation
4
Geometric Objects and
Transformations Basic Three Dimensional Programming
5
Viewing
Transformations
6 Shading Lights and Materials
7
Review and Mid-term
8 Discrete Techniques Images
9 Implementation of a Renderer Texture Mapping
10 Hierarchal and
Object-Oriented Programming Curves and Surfaces.
11 Curves and
Surfaces Putting it together
and moving on
12 Procedural
Methods
13 Vizualition
14 Review and
Project Demonstration
15 Comprehensive
Final Exam Wednesday December 8, 2004 8:00 TO 9:50
INSTRUCTIONAL STRATEGIES:
Students will engage in learning activities, which include assigned readings, homework, classroom discussion, and computer laboratory work.
COURSE REQUIREMENTS AND EVALUATION STRATEGIES:
Two exams and the final comprehensive exam will be given. There will be no make up exams except for a valid document from a doctor. Homework will be assigned frequently and late homework will not be accepted.
Quizzes 15%
Tests
45%
Project 40% (day of
final)
Grading Scale:
Over 88 A
75 - 87 B
62 - 74 C
50 - 61 D
Below 49 F
ATTENDANCE POLICY:
If four classes are missed without an excuse, the course grade will be reduced by one letter. If six classes are missed without an excuse, the grade F will be given. An excused absence may be granted if a student provides a written statement from a doctor concerning an illness, a statement concerning a death in the family or a statement describing other serious reasons deemed valid by the instructor.
For more
Information Computer Graphics
: Computer
Graphics Computer
Graphics Computer Graphics Computer Graphics Computer Graphics
Using a GUI Toolkit Computer Graphics
Computer
Graphics Computer
Graphics Computer Graphics
Graphics Computer ComputerComputer
Graphics Computer
Graphics Computer
Graphics Computer
Graphics Modelling Computer Graphics
Projects Computer
Graphics Computer
Graphics Web Pages
DISCRETE TECHNIQUES
Bitmaps are rectangles of zeros and ones specifying a particular pattern of
fragments to be produced. Each of these fragments has the same associated data.
These data are those associated with the current raster position.
IMPLEMENTATION OF A RENDERER
Rasterization
of a polygon Rasterization
Clipping
Clipping is the process of determining the portion of a primitive lying within
a region called the clip region.
Depending on clip region (plane, volume, multiple) and primitive (point,
line, polygon, volume and multiple)
different techniques are used.
The clip region is typically either a window on a screen or a view volume. This
case can be handled by simple algorithms like the Sutherland-Hodgman clip
algorithm.
But, for example in multiple-window environments, various rectangular windows
overlap one another, and the clip region can be an arbitrary set of polygons.
The primitives being clipped may be for example 1D (e.g., lines) or 2D (e.g.,
filled polygones). It is easy to think that once line clipping is solved, so is
polygon clipping: Just clip all the edges of the polygon to the window and
draw. This assumption fails, however, if the polygon completely encloses the
clip window. Clipping 2d primitives is a more difficult problem than is
clipping 1D primitives.
Note also, that clipping can change the primitive. Clipping a concave polygon
against a clip rectangle can result in multiple polygons.
Problem
in Cohen-Sutherland Clipping