CS352/CmpE352
Computer Graphics I
Spring 2002-03

Highlights:
Program 3 Posted

Back to Main page

Assignment 1: Problems 1.1, 1.3, 1.4, 1.6 from Angel
Assigned on Mar 5th, Due March 12th before class

Program 1: Image Manipulation, Synthetic Lighting for Photography
Assigned on Mar 5th, Due March 12th before class.

Look at this website: http://www.sgi.com/grafica/synth/index.html

You are required to write two basic functions:

• ReadPPM should read a binary .ppm file and represent the pixel data in an array data-structure
• WritePPM should take the pixel data and write it out in the proper .ppm binary format

Once the data has been read into your program, you can start manipulating it. In this program, you may add images, subtract them and multiply them by a scalar. By such manipulation, you will be able to achieve interesting results

Basic dataset is available here: Data1.zip 405Kb contains 3 images

Some possible outputs are shown:

You are encouraged to generate as many different interesting outputs as you can (within reasonable limits).

You must submit a report, and working code. The report should be short, describing the different operations that you did to generate different images (report should include outputs). The code should take the 3 image names as input, so that I can test it on other data that has similar lamps configuration (both ON, one ON, ambient).

If needed, email me and we can look into the possibility of arranging an extra help session (as long as it is well before the last night!)

Program 2: Posted 12th Mar, Due 19th Mar

Write a program which will take as input the following:

• A set of vertices from a file
• A point from command line

It should output whether the polygon formed from the ordered vertices is convex or not. If it is convex, whether the point is inside the polygon or not.

Your report should clearly describe your choice of algorithm, and the time complexity of the algorithm.

A sample polygon file has the following format: The first line contains the number of vertices. Each subsequent line contains two float values specifying the vertex. The vertex in line1 is connected to that in line2, which is connected to that in line3 and so on. The last vertex is connected to the first one to complete the polygon.

Assignment 2: Posted 25th Mar, Due 1st April - Download here [PDF document 102KB]
Solution: Download or get a copy from the photocopier

view in powerpoint format (slide show)
All problems (1-30): download here (1.16 MB)
Problems 01-10 (405 KB)
Problems 11-20 (345 KB)
Problems 21-30 (409 KB)

Program 3: Posted 2nd April, Due 15th April Before Class

- Download handout here
- Dowload skeleton code here

- Solution (Posted April 15th, 2003)

Program 4

This programming assignment will be worth twice the weight of the others that we have done. The game that you have to implement for Program 4 is "Block Out" in the \blocks folder in \\badar\Common\cs352. You only have to implement the flat blockset, do not have to do slow rotations, only 3x3x12 pit needs to be implemented. Practice mode and demo mode are also not necessary to implement. You do need to have scores, and multiple levels. You do need to implement 6 types of rotations (c-wise and cc-wise on each axis), arrow keys for translation. Space bar for for fast drop is optional. Additional blocksets, pit-sizes, sounds, slow-rotations, other features may be tried for fun. Final due date is Monday 5th May, but a design document is due this Friday. More details in this handout