• EN

Computer Graphics 1

What you Need to Pass

• Attend lessons. One missed +0 points. 2 missed 0 points, 3 missed 0 points, 4 and more is Fx.
• Project and exercise (mandatory, 70 points).
• Solve all homework problems (mandatory each one >=30%, 10 points)
• Mid term (mandatory, 20 points)
• Pass final term (mandatory, 15 points) You will need to solve several problems discussed during lessons.
• Pass oral/written exam: (mandatory, +15 points)
• Summary
• Attendance = 0 or -100 (Fx)
• Exercise = +50..0
• Activity = +10..0 (optional)
• Project = +20..0 (optional)
• Homework = +10..3 or +3..0 (Fx)
• Mid term = +20..0
• Final term = +15..0
• Oral/written exam = +15..0
• A = 92-100
• B = 84-91
• C = 76-83
• D = 68-75
• E = 60-67
• Fx = 0-59
• Schedule
• Mon (18:10) - Room A (lecture)
• Mon (10:40) - Room H3 (seminar)
• Tue (09:50) - Room H6 (seminar)

Lesson01 "Introduction to Computer Graphics"

• Computer Graphics Applications
• Graphics Pipeline
• Lecture notes: lesson01.pdf

Lesson02 Lesson03 "Scene Representations"

• Representation of Curves
• Representation of Volumes
• Representation of Surfaces
• Lecture notes: lesson02.pdf
• Štátnicová téma: Reprezentácie objektov v počítačovej grafike. (Mnohouholníkové siete, splajny, CSG, volumetrické reprezentácie (BSP, octree), implicitné reprezentácie. Výhody a nevýhody jednotlivých reprezentácií, vzájomné konverzie.)
• Homework 1: HomeworkSet01.pdf deadline next week.

Lesson04 "Transformations and Projections"

• Linear Transformations
• Affine Transformations
• Perspective Projections
• Parallel Projections
• Lecture notes: lesson04.pdf
• Poznámky v Slovenčine k téme Transformacie a Súradnice kamery
• Štátnicová téma: Zobrazovací kanál. (Modelovanie 3D scény, snímanie, premietanie - rovnobeľné, stredové a ich vzájomný súvis. Súradnicové sústavy v zobrazovacom kanáli. Zaradenie algoritmov počítačovej grafiky (riešenie viditeľnosti, orezávanie...) do zobrazovacieho kanála. Zobrazovací kanál dvojrozmernej scény.)

Lesson05 "Line Clipping"

• Line clipping algorithms in the CG Pipeline
• Cohen-Sutherland
• Cyrus-Beck
• Nicholl-Lee-Nicholl
• Polygon clipping algorithms
• Sutherland-Hodgeman
• Lecture notes: lesson05.pdf
• Poznámky v Slovenčine k téme Orezavanie
• Štátnicová téma: Hľadanie prienikov a orezávanie. (Prieniky v rovine: prienik úsečiek, polpriamok, prienik s mnohouholníkom, prienik s konvexným mnohouholníkom, metódy hľadania prieniku úsečky a krivky. Prieniky v priestore: prienik úsečky a roviny, prienik úsečky a mnohouholníka. Algoritmy Cohen-Sutherland, Cyrus-Beck, Liang-Barsky a Nichol-Lee-Nichol pre orezávanie úsečky do okna. Orezávanie mnohouholníka do okna.)

Lesson06 [27.10] "Intersections and Scan Line Raterization"

• Computing basic intersections
• Orientation function
• Edge intersection tests
• Scan Line conversion algorithm
• Lecture notes: lesson06.pdf
• Lecture notes in slovak: lesson06SK.pdf
• Poznámky v Slovenčine k téme Prieniky
• Homework 2: HomeworkSet02.pdf deadline for Example 1 and 2 next week [till 3. nov. 2014].

Lesson07 [3.11] "Rasterization"

• Line rasterization: DDA, Bresenham, Midpoint
• Curve rasterization: Midpoint, Bresenham
• Polygon rasterization
• Filling algorithms: flood fill, boarder fill
• Lecture notes: lesson07.pdf
• Poznámky v Slovenčine k téme Rasterizácia
• Štátnicová téma: Rasterizácia a antialiasing. (Algoritmy rasterizácie úsečky. Rasterizácia kvadratickej krivky, rasterizácia mnohouholníka pomocou skenovacej priamky. Prístupy k vypĺňaniu oblastí. Alias a metódy antialiasingu.)
• Homework 2: HomeworkSet02.pdf deadline for Example 3 next week [till 10. nov. 2014, please handle the homework scan in the electronic form by email to prof. Durikovic, with the subject: CG1 EXAMPLE 3].

Lesson08 [10.11 Mihalik, Piovarci] "Midterm test"

• Test problems are similar to homework problems.
• Sit in lecture room A, two rows of seats will be free between rows of students, three seats will be free between students in row.
• Test results 18.11.

Lesson10 [24.11 Mihalik] "Aliasing, Antialiasing and Visible Surface Determination"

• Aliasing, Nyquist frequency - Aliasing Aditional Material
• Antialiasing: Postfiltering, Prefiltering, MSAA, CSAA - Antialiasing
• Visibility Surface Determination: Object Space, Image Space, Priority List
• Painter's Algorithm, Newel-Newel-Sancha
• Schumacker, BSP-tree
• Warnock's Algorithm
• Z-buffer
• Octree
• Lecture notes: lesson07.pdf
• Štátnicová téma: Algoritmy pre určovanie viditeľného povrchu. (Algoritmy v priestore objektov: využitie normálových vektorov, maliarove algoritmy, využitie volumetrických reprezentácií. Algoritmy v priestore obrazu: z-buffer, delenie okna. špeciálne algoritmy: zobrazovanie drôteného modelu, zobrazovanie grafu funkcie.)

Lesson11 [1.12 Mihalik] "The Graphics Pipeline"

• What is The Graphics Pipeline
• Primitive Assembly
• Geometry Postprocessing and Rasterization
• Frame Buffer Operations
• Lecture notes: lesson04.pdf

Lesson12 [8.12] "Representation and Blending of Images"

• Color Models
• Image Blending Modes
• Lecture notes: lesson10.pdf

Lesson13 [15.12] "FINAL test"

• Test problems are similar to homework problems.
• Sit in lecture room A, two rows of seats will be free between rows of students, three seats will be free between students in row.
• Expect the test results till 24:00.
• Bring the student index with you! Who fails has Fx.
• Those wishing to get credits from CG1 this day, MUST pass the test with A (96-100%) and wait till the test results.

Seminars

• On every seminar we will implement selected problems/algorithms from lessons. We will usually start with a prearranged template downloadable from this site.
• As a programming language we will use C#. We will use Visual C# 2010 Express / Sharp Develop as a development environment. Alternatively you can use MonoDevelop (Linux / Mac OSX) on your own machine.
• Don't cheat - create instead. Any kind of cheating is punished by withholding 15 points of your final evaluation for all involved students. Situation where only part of code is shared is also considered cheating!
• Attendance at seminars is optional, but recommended.
• Additional activity can be awarded by max 10 points of your final evaluation.

Assignments

• Assignment must be submitted until next deadline 24:00
• Tuesday seminar attendees should submit their assignments during the seminar or by the email to cg1.2013.hw@gmail.com.
• Please remove exe from zip file or use a link to another repository.
• Monday seminars submission email is cg1.2014.hw@gmail.com
• Your submission email must have title in form 'ExNN' where NN is the number of exercise, eg. Ex05.
• You can get max 100% per assignment. Late submission is for 0%.
• It is required to submit compilable zipped source code of your homework. Do not send only executable files. Homework without source code is for 0%.
• Your code should be well formatted and commented. Titles of functions, classes, variables should be representative for their purpose.

Project

• Project is your opportunity to gain additional 20 points of your final evaluation (during the semester) and it is optional. It must be submitted by email to cg1.2013.hw@gmail.com including your solution and source files.
• Submission until - 6 days before you final term
• Project assignments - Choose among these themes or create your own. You should notify cg1.2013.hw@gmail.com with your idea about the chosen project (idea, language, implementation, application). More info in person on M113.
• Ideas:
• Voxel Data Structure - 3D should be used, generate voxelization of objects
• Advanced Mesh Transformations - Take blender mesh function and implement it
• Gimp Layer functions - Darken, Soft light, ...
• Displacement Modeling - a.k.a Z-brush
• Other - Specify in the email

Exercise01 [29.09/30.10] "Vectors and Matrices"

• Create a simple application for vectors(4x1) and matrices(4x4)
• Info | Sample | Template
• Bonus implement unit tests:
• Add drop-down option called Unit Test
• Create 2 tests for each arithmetic operation in the drop-down menu
• Compare the result calculated by your implementation with a precalculated result
• Count successful tests and output final score to console

Exercise02 [6/7.10] "Show of Your Curves"

• Create a simple application to compute bezier curve using De Casteljau algorithm.
• Info | Sample | Template
• Extended deadline (-30% from evaluation): 19.10 24:00

Exercise03 [13/14.10] "(ง ͠° ͟ʖ ͡°)ง Raise Your Matrices (ง ͠° ͟ʖ ͡°)ง"

• Create a simple aplication that can create, scale and rotate polylines
• Sample | Template
• Extended deadline (-30% from evaluation): 26.10 24:00

Exercise04 [20/21.10] "Half-Edge Trick"

• And now ladies and gentlemen I will saw this edge in half. (Suspense - Applause - Performance)
• Implement a simple mesh representation in 2D. Use half-edge data structure. Implement loading data from file.off and filling the structure. As usual you should use a similar functionality and drawing as in the sample application - already in template.
• Info | Navigating HalfEdge | Sample | Template
• Bonus: (2 points) implement interactive half-edge generation:
• Right clicking in GUI will add new points
• remember to merge points with already existing points
• Each 3 point will create a new face
• remember to correctly set Next and Opposite half edges
• Extended deadline (-30% from evaluation): 2.11 24:00

Exercise05 [27/28.10] "The One About Clipping"

• Your mission, should you choose to accept it, is to implement two clipping algorithms: Cohen-Sutterland and Cyrus-Beck. Implemented algorithms should be those algorithms by definition. Pseudocodes are in the 'Clipping' lesson. The interaction and GUI are in the template application.
• Sample | Template
• How to determine if a list of polygon points are in clockwise order
• This assignment will self-destruct 2.11 24:00 (morning). Good luck.
• In case of system bug 9.11 24:00

Exercise06 [3/4.11] "AMA (Ask Me Anything)"

• Q&A before midterm exam
• Sample assignments for practice
• There is no assignment this week