m (Durikovic premiestnil stránku CG1 2013/en na Course:Computer Graphics 1/sk)
 
(24 intermediate revisions by 3 users not shown)
Line 28: Line 28:
 
** Fx = 0-59
 
** Fx = 0-59
  
 +
<!-- Commented stuff start
 
* [https://docs.google.com/spreadsheet/ccc?key=0AguOJecPQwoSdHFDYnRaZTZHZFJlcWFJWkZjX3ZsNGc&usp=sharing VIEW RESULTS]
 
* [https://docs.google.com/spreadsheet/ccc?key=0AguOJecPQwoSdHFDYnRaZTZHZFJlcWFJWkZjX3ZsNGc&usp=sharing VIEW RESULTS]
 +
Commnet end
 +
-->
  
 
* Schedule
 
* Schedule
Line 44: Line 47:
  
 
----
 
----
 
+
<!-- Commented stuff start
 
=== Lesson01 "Introduction to Computer Graphics" ===
 
=== Lesson01 "Introduction to Computer Graphics" ===
 
* Computer Graphics Applications
 
* Computer Graphics Applications
Line 51: Line 54:
  
 
=== Lesson02 Lesson03 "Scene Representations" ===
 
=== Lesson02 Lesson03 "Scene Representations" ===
[[File:cg1_2012_lesson02.png|link=http://dai.fmph.uniba.sk/upload/0/03/Cg1_2012_lesson03.pdf]]
+
[[File:cg1_2012_lesson02.png|link=https://dai.fmph.uniba.sk/upload/f/f1/Cg1_lesson02.pdf]]
 
* Representation of Curves
 
* Representation of Curves
 
* Representation of Volumes
 
* Representation of Volumes
Line 60: Line 63:
  
 
=== Lesson04 "Transformations and Projections" ===
 
=== Lesson04 "Transformations and Projections" ===
[[File:cg1_2012_lesson04.png|link=https://dai.fmph.uniba.sk/upload/a/a7/Cg1_2012_lesson04.pdf]]
+
[[File:cg1_2012_lesson04.png|link=https://dai.fmph.uniba.sk/upload/e/ea/Cg1_lesson04.pdf]]
 
* Linear Transformations
 
* Linear Transformations
 
* Affine Transformations
 
* Affine Transformations
Line 70: Line 73:
  
 
=== Lesson05 "Line Clipping" ===
 
=== Lesson05 "Line Clipping" ===
[[File:cg1_2012_lesson06.png|link=https://dai.fmph.uniba.sk/upload/2/27/Cg1_2012_lesson06.pdf]]
+
[[File:cg1_2012_lesson06.png|link=https://dai.fmph.uniba.sk/upload/9/9e/Cg1_lesson05.pdf]]
 
* Line clipping algorithms in the CG Pipeline
 
* Line clipping algorithms in the CG Pipeline
 
* Cohen-Sutherland
 
* Cohen-Sutherland
Line 82: Line 85:
  
 
=== Lesson06 [27.10] "Intersections and Scan Line Raterization" ===
 
=== Lesson06 [27.10] "Intersections and Scan Line Raterization" ===
[[File:cg1_2012_lesson07.png|link=https://dai.fmph.uniba.sk/upload/5/52/Cg1_2012_lesson07.pdf]]
+
[[File:cg1_2012_lesson07.png|link=https://dai.fmph.uniba.sk/upload/1/11/Cg1_lesson06.pdf]]
 
* Computing basic intersections
 
* Computing basic intersections
 
* Orientation function
 
* Orientation function
 
* Edge intersection tests
 
* Edge intersection tests
 
* Scan Line conversion algorithm
 
* Scan Line conversion algorithm
* Lecture notes: [[media:cg1_2012_lesson07.pdf|lesson06.pdf]]
+
* Lecture notes: [[media:cg1_lesson06.pdf|lesson06.pdf]]
 +
* Lecture notes in slovak: [[media:cg1_lesson06SK.pdf|lesson06SK.pdf]]
 
* Poznámky v Slovenčine k téme [[media:cg1_Prieniky.pdf|Prieniky]]  
 
* Poznámky v Slovenčine k téme [[media:cg1_Prieniky.pdf|Prieniky]]  
 
* Homework 2: [[media:cg1_HomeworkSet02.pdf|HomeworkSet02.pdf]] deadline for Example 1 and 2 next week [till 3. nov. 2014].
 
* Homework 2: [[media:cg1_HomeworkSet02.pdf|HomeworkSet02.pdf]] deadline for Example 1 and 2 next week [till 3. nov. 2014].
  
 
=== Lesson07 [3.11] "Rasterization" ===
 
=== Lesson07 [3.11] "Rasterization" ===
[[File:cg1_2012_lesson08.png|link=https://dai.fmph.uniba.sk/upload/2/22/Cg1_2012_lesson08.pdf]]
+
[[File:cg1_2012_lesson08.png|link=https://dai.fmph.uniba.sk/upload/3/3d/Cg1_lesson07.pdf]]
 
* Line rasterization: DDA, Bresenham, Midpoint
 
* Line rasterization: DDA, Bresenham, Midpoint
 
* Curve rasterization: Midpoint, Bresenham
 
* Curve rasterization: Midpoint, Bresenham
 
* Polygon rasterization
 
* Polygon rasterization
 
* Filling algorithms: flood fill, boarder fill
 
* Filling algorithms: flood fill, boarder fill
* Lecture notes: [[media:cg1_2012_lesson08.pdf|lesson08.pdf]]
+
* Lecture notes: [[media:cg1_lesson07.pdf|lesson07.pdf]]
 +
* Poznámky v Slovenčine k téme [[media:cg1_Rasterizacia.pdf|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.)
 
* Š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: [[media:cg1_HomeworkSet02.pdf|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].
 
* Homework 2: [[media:cg1_HomeworkSet02.pdf|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] "Aliasing, Antialiasing and Visible Surface Determination" ===
+
=== 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.
 +
 
 +
=== Lesson09 [17.11] "Štátny sviatok" ===
 +
 
 +
=== Lesson10 [24.11 Mihalik] "Aliasing, Antialiasing and Visible Surface Determination" ===
 
[[File:cg1_2012_lesson09.png|link=https://dai.fmph.uniba.sk/upload/4/4a/Cg1_2012_lesson09.pdf]]
 
[[File:cg1_2012_lesson09.png|link=https://dai.fmph.uniba.sk/upload/4/4a/Cg1_2012_lesson09.pdf]]
 
* Aliasing, Nyquist frequency - [http://www.sccg.sk/~durikovic/classes/CG1/Handouts/aliasing.pdf Aliasing] [http://www.math.ubc.ca/~feldman/m267/dft.pdf Aditional Material]
 
* Aliasing, Nyquist frequency - [http://www.sccg.sk/~durikovic/classes/CG1/Handouts/aliasing.pdf Aliasing] [http://www.math.ubc.ca/~feldman/m267/dft.pdf Aditional Material]
Line 114: Line 126:
 
* Š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.)
 
* Š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.)
  
=== Lesson10 [17.11 Mihalik, Piovarci] "Midterm test" ===
+
=== Lesson11 [1.12 Mihalik] "The Graphics Pipeline" ===
* 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.
+
 
+
=== Lesson11 [24.11 Mihalik] "The Graphics Pipeline" ===
+
 
[[File:cg1_2012_lesson05.png|link=https://dai.fmph.uniba.sk/upload/6/64/Cg1_2012_lesson05.pdf]]
 
[[File:cg1_2012_lesson05.png|link=https://dai.fmph.uniba.sk/upload/6/64/Cg1_2012_lesson05.pdf]]
 
* What is The Graphics Pipeline
 
* What is The Graphics Pipeline
Line 131: Line 138:
 
* Lecture notes: [[media:cg1_2012_lesson05.pdf|lesson04.pdf]]
 
* Lecture notes: [[media:cg1_2012_lesson05.pdf|lesson04.pdf]]
  
=== Lesson12 [1.12] "Representation and Blending of Images" ===
+
=== Lesson12 [8.12] "Representation and Blending of Images" ===
 
[[File:cg1_2012_lesson11.png|link=https://dai.fmph.uniba.sk/upload/b/b3/Cg1_2012_lesson11.pdf]]
 
[[File:cg1_2012_lesson11.png|link=https://dai.fmph.uniba.sk/upload/b/b3/Cg1_2012_lesson11.pdf]]
 
* Color Models
 
* Color Models
Line 155: Line 162:
  
 
----
 
----
 +
  
 
== Seminars ==
 
== Seminars ==
Line 174: Line 182:
  
 
== Project ==
 
== 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 [mailto:cg1.2013.hw@gmail.com  cg1.2013.hw@gmail.com] including your solution and source files.
+
* 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 [mailto:mihalik@sccg.com  mihalik@sccg.com] including your solution and source files.
 
* Comment your code and add help!
 
* Comment your code and add help!
 
* Submission until - 6 days before you final term
 
* Submission until - 6 days before you final term
* Project assignments - Choose among these themes or create your own. You should notify [mailto:cg1.2013.hw@gmail.com  cg1.2013.hw@gmail.com] with your idea about the chosen project (idea, language, implementation, application). More info in person on M113.
+
* Project assignments - Choose among these themes or create your own. You should notify [mailto:mihalik@sccg.com  mihalik@sccg.com] with your idea about the chosen project (idea, language, implementation, application). More info in person on M113.
 
* '''Ideas:'''
 
* '''Ideas:'''
 
** Voxel Data Structure - 3D should be used, generate voxelization of objects
 
** Voxel Data Structure - 3D should be used, generate voxelization of objects
Line 184: Line 192:
 
** Displacement Modeling - a.k.a Z-brush
 
** Displacement Modeling - a.k.a Z-brush
 
** Other - Specify in the email
 
** Other - Specify in the email
 +
 
<!-- ::::ARCHIVE::::
 
<!-- ::::ARCHIVE::::
 
[[media:Ex01.Sample.zip|Sample]] | [[media:Ex01.Template.zip|Template]]
 
[[media:Ex01.Sample.zip|Sample]] | [[media:Ex01.Template.zip|Template]]
 
[[media:Ex02.Sample.zip|Sample]] | [[media:Ex02.Template.zip|Template]]
 
[[media:Ex02.Sample.zip|Sample]] | [[media:Ex02.Template.zip|Template]]
 +
[media:Ex08.Template.zip|Template]
 +
-->
 +
<!-- Commented stuff start
 
-->
 
-->
 
=== Exercise00 [22/23.09] "Introduction" ===
 
=== Exercise00 [22/23.09] "Introduction" ===
Line 202: Line 214:
 
** Compare the result calculated by your implementation with a precalculated result
 
** Compare the result calculated by your implementation with a precalculated result
 
** Count successful tests and output final score to console
 
** Count successful tests and output final score to console
<!-- * Please, questions about assignments address to Matej Hudak (mail, in person - M162) -->
 
  
 
=== Exercise02 [6/7.10] "Show of Your Curves" ===
 
=== Exercise02 [6/7.10] "Show of Your Curves" ===
Line 227: Line 238:
 
* '''Deadline:''' 26.10 24:00
 
* '''Deadline:''' 26.10 24:00
 
* '''Extended deadline (-30% from evaluation): ''' 2.11 24:00
 
* '''Extended deadline (-30% from evaluation): ''' 2.11 24:00
<!--
+
 
 
=== Exercise05 [27/28.10] "The One About Clipping" ===
 
=== 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.
 
* 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.
 
* [[media:Ex04.Sample.zip|Sample]] | [[media:Ex04.Template.zip|Template]]
 
* [[media:Ex04.Sample.zip|Sample]] | [[media:Ex04.Template.zip|Template]]
 +
* [http://stackoverflow.com/questions/1165647/how-to-determine-if-a-list-of-polygon-points-are-in-clockwise-order 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.
 
* '''This assignment will self-destruct''' 2.11 24:00 (morning). Good luck.
 
* '''In case of system bug''' 9.11 24:00
 
* '''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'''
 +
 +
=== Exercise07 [10/11.11] "Virtual Knitting" ===
 +
* Implement Scan Line algorithm. Implemented algorithms should be those algorithms by definition. The interaction and GUI are in the template application. Use materials from the lecture and additional material [http://flurry.dg.fmph.uniba.sk/webog/SuboryOG/zatko/4.VYPLNANIE2011.pdf]
 +
* Bonus - flood fill algorithm. Algorithm from the lecture [0.5 points]. Other [1 point]
 +
* Bonus - use scanline to fill 3D volume. Use OpenGL to work with mesh (Ex03) and fill 3D mesh like [[media:Input.png|input]] with cubes / spheres similar to [[media:Result.png|result]] [max 5 points]
 +
* [[media:Ex08.Sample.zip|Sample]] | [[media:CG1.Ex08.Template.zip|Template]]
 +
* '''Deadline:''' 23.11 24:00
 +
* '''Extended deadline (-30% from evaluation): ''' 30.11 24:00
 +
 +
=== Exercise08 [24/25.11] "Draw Me Like One of Your French Pixels" ===
 +
* Implement a rasterization of three objects: line, circle and ellipse. Use additional material if necessary. [[media:Ellipse.pdf|Ellipse]]
 +
* Bonus - curve rasterization. Bezier curve [0.5 points]. Other than bezier curve [2 points]
 +
* [[media:Ex07.Sample.zip|Sample]] | [[media:Ex07.Template.rar|Template]]
 +
* '''Deadline:''' 7.12. 24:00
 +
* '''Extended deadline (-30% from evaluation): ''' 14.12 24:00
 +
 +
=== Exercise09 [1/2.12] "Now You See Me" ===
 +
* And now you don't. Look closely, because the closer you think you are, the more you'll actually understand.
 +
* Implement a visible surface determination algorithm Z-buffer. As usual you should use a similar functionality and drawing as in the sample application.
 +
* [[media:Ex06.Info.pdf|Info]] | [[media:CG1.Zbuffer.pdf | Z-buffer]]| [[media:Ex06.Sample.zip|Sample]] | [[media:Ex06.Template.zip|Template]]
 +
* '''Bonus:'''
 +
** Antialisaing [1 point]
 +
** Gaussian blur [1 point], using separable kernel [+1 point]
 +
** Phong shading [1 point]
 +
* '''Deadline:''' 7.12. 24:00
 +
* '''Extended deadline (-30% from evaluation): ''' 14.12 24:00
 +
 +
=== Exercise10 [8/9.12] "AMA 2 (Ask Me Anything)" ===
 +
* Q&A before final exam
 +
* Sample assignments for practice
 +
* [http://www.songho.ca/opengl/gl_projectionmatrix.html Projection]
 +
* '''There is no assignment this week'''
 +
 +
 +
<!-- Comments
 
=== Exercise03 [21/22.10] "3D Mesh? No Problem" ===
 
=== Exercise03 [21/22.10] "3D Mesh? No Problem" ===
 
* We will work with OpenGL library in C#. Library is [http://www.opentk.com/ OpenTK] - direct support for OpenGL in C# - [[media:OpenGLIntro.pdf|OpenGL Intro]]. This exercise is introduction to 3D CG. We will use [http://www.opentk.com/project/Meshomatic Meshomatic] library. There is no assignment this week.  
 
* We will work with OpenGL library in C#. Library is [http://www.opentk.com/ OpenTK] - direct support for OpenGL in C# - [[media:OpenGLIntro.pdf|OpenGL Intro]]. This exercise is introduction to 3D CG. We will use [http://www.opentk.com/project/Meshomatic Meshomatic] library. There is no assignment this week.  
Line 254: Line 305:
 
* [[media:Ex06.Info.pdf|Info]] | [[media:Ex06.Sample.zip|Sample]] | [[media:Ex06.Template.zip|Template]]
 
* [[media:Ex06.Info.pdf|Info]] | [[media:Ex06.Sample.zip|Sample]] | [[media:Ex06.Template.zip|Template]]
 
* Deadline: 9.12 6:00AM (Morning)
 
* Deadline: 9.12 6:00AM (Morning)
 
=== Exercise07 [02/03.12] "Draw Me Like One of Your French Pixels" ===
 
* Implement a rasterization of three objects: line, circle and ellipse. Use additional material if necessary. [[media:Ellipse.pdf|Ellipse]]
 
* Bonus - curve rasterization. Bezier curve [0.5 points]. Other than bezier curve [2 points]
 
* [[media:Ex07.Sample.zip|Sample]] | [[media:Ex07.Template.rar|Template]]
 
* Deadline: 9.12 6:00AM (Morning)
 
 
=== Exercise08 [09/10.12] "Virtual Knitting" ===
 
* Continue from previous exercise and implement Scan Line algorithm. Implemented algorithms should be those algorithms by definition. The interaction and GUI are in the template application. Use materials from the lecture and additional material [http://flurry.dg.fmph.uniba.sk/webog/SuboryOG/zatko/4.VYPLNANIE2011.pdf]
 
* Bonus - flood fill algorithm. Algorithm from the lecture [0.5 points]. Other [1 point]
 
* Bonus - use scanline to fill 3D volume. Use OpenGL to work with mesh (Ex03) and fill 3D mesh like [[media:Input.png|input]] with cubes / spheres similar to [[media:Result.png|result]] [max 5 points]
 
* [[media:Ex08.Sample.zip|Sample]] | [[media:Ex08.Template.zip|Template]]
 
* Deadline: 23.12 6:00AM (Morning)
 
 
-->
 
-->

Latest revision as of 08:37, 11 September 2017

Cg1 2013.jpg

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
  • Grades
    • 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)


Materials to read




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 mihalik@sccg.com including your solution and source files.
  • Comment your code and add help!
  • Submission until - 6 days before you final term
  • Project assignments - Choose among these themes or create your own. You should notify mihalik@sccg.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

Exercise00 [22/23.09] "Introduction"

Exercise01 [29.09/30.10] "Vectors and Matrices"

  • Create a simple application for vectors(4x1) and matrices(4x4)
  • Info | Sample | Template
  • Inverse Matrix | Adjoint Matrix | Adjoint Matrix Wiki
  • Deadline: 5.10 24:00
  • 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
  • Deadline: 12.10 24:00
  • 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
  • Deadline: 19.10 24:00
  • 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
  • Deadline: 26.10 24:00
  • 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

Exercise07 [10/11.11] "Virtual Knitting"

  • Implement Scan Line algorithm. Implemented algorithms should be those algorithms by definition. The interaction and GUI are in the template application. Use materials from the lecture and additional material [1]
  • Bonus - flood fill algorithm. Algorithm from the lecture [0.5 points]. Other [1 point]
  • Bonus - use scanline to fill 3D volume. Use OpenGL to work with mesh (Ex03) and fill 3D mesh like input with cubes / spheres similar to result [max 5 points]
  • Sample | Template
  • Deadline: 23.11 24:00
  • Extended deadline (-30% from evaluation): 30.11 24:00

Exercise08 [24/25.11] "Draw Me Like One of Your French Pixels"

  • Implement a rasterization of three objects: line, circle and ellipse. Use additional material if necessary. Ellipse
  • Bonus - curve rasterization. Bezier curve [0.5 points]. Other than bezier curve [2 points]
  • Sample | Template
  • Deadline: 7.12. 24:00
  • Extended deadline (-30% from evaluation): 14.12 24:00

Exercise09 [1/2.12] "Now You See Me"

  • And now you don't. Look closely, because the closer you think you are, the more you'll actually understand.
  • Implement a visible surface determination algorithm Z-buffer. As usual you should use a similar functionality and drawing as in the sample application.
  • Info | Z-buffer| Sample | Template
  • Bonus:
    • Antialisaing [1 point]
    • Gaussian blur [1 point], using separable kernel [+1 point]
    • Phong shading [1 point]
  • Deadline: 7.12. 24:00
  • Extended deadline (-30% from evaluation): 14.12 24:00

Exercise10 [8/9.12] "AMA 2 (Ask Me Anything)"

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