Verzia zo dňa a času 13:18, 14. december 2014

Lecture Monday 16:30 B Exercise Thursday 8:10 I-9

Grading

No make-up exams will be given for missed tests. All the assignments should be turn in by the designated due date. To pass this course all the course requirements must be SATISFACTORILY completed > 30% of each problem set.

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, 50 points).
• Solve all homework problems (mandatory each one >=30%, 20 points)
• Pass final term (mandatory, 10 points) You will need to solve several problems discussed during lessons.
• Pass oral/written exam: (optional, +20 points) If you feel you are better, convince me !
• Summary
  • Attendance = 0 or -100 (Fx)
  • Homework = +20..7 or +6..0 (Fx)
  • Project = +50..0
  • Mid term = +10..0
  • Final term = +20..0
  • Oral/written exam = +20..0

• Grades
  • A = 92-100
  • B = 84-91
  • C = 76-83
  • D = 68-75
  • E = 60-67
  • Fx = 0-59

• VIEW RESULTS

Oral Examination

To the oral examination all the above requirements must be SATISFACTORILY completed.

Materials to read

• Michael Henle, "A Combinatorial Introduction to Topology"
• J. O'Rourke, "Computational Geometry in C"
• IA. T. Fomenko and T. L. Kunii, "Topological Modeling for Visualization"

Useful links

• http://www.sccg.sk/~durikovic/graphicsutil/index.html
• http://xxx.lanl.gov/abs/cs/9909001

Lesson01 "Human visual system, Illusions"

Lecture notes: [pdf], Color theory: [pdf]

Reading(prepare 3 questions and the core idea of article): R. Ďurikovič and K. Kolchin. Physically-based model of photographic effects for night and day scenes, Journal of Three Dimensional Images, 3D Forum Society, vol. 15, No.4, pages 119-124, 2001. [pdf]

Lesson02 "Photographic Effects, HDR and Tone Mapping"

Lecture notes: [pdf]

Reading evaluation.

Lesson03 "Three dimensional modeling"

Lecture notes: [pdf]

Demo animation: R. Ďurikovič, K. Kaneda, and H. Yamashita. Dynamic contour: a texture approach and contour operations. The Visual Computer, 11(6), pages 277-289, May 1995. [pdf]

Lesson04 "Three dimensional transformations"

Lecture notes: [pdf]

Demo animation: R. Ďurikovič, K. Kaneda, and H. Yamashita. Imaging and modelling from serial microscopic sections for the study of anatomy. Medical & Biological Engineering & Computing, 36(5), pages 276-284, 1998. [pdf]

Lesson05 "Representation of solids"

Lecture notes: [pdf]

Midterm 1 + questions from the following articles.

Demo animation: Roman Ďurikovič, Silvester Czanner, Julius Parulek and Miloš Šrámek. Heterogeneous modeling of biological organs and organ growth. In book: Alexander Pasko, Valery Adzhiev, and Peter Comninos. LNCS 4889: Heterogeneous Objects Modeling and Applications. Springer Press, Berlin, 2008. [pdf]

Lesson06 "Functional representation"

Lecture notes: [pdf]

R. Ďurikovič. Growth simulation of digestive system using function representation and skeleton dynamics, International Journal on Shape Modeling, vol. 10, No.1, pages 31-49, World Scientific Publishing Company, Singapore, 2004.[pdf]

Lesson07 "Test (midterm) 2"

Demo animation: Roman Ďurikovič and Zuzana Kúkelová. Sketch-based modelling system with convolution and variational implicit surfaces, Journal of the Applied Mathematics, Statistics and Informatics, University of Saint Cyril and Metod Press, Trnava, Slovakia, vol. 4, No.1, pages 101-108, 2008.

Lesson08 "Computational topology of polygonal surfaces"

Lecture notes: [pdf]

Demo animation: Y. Wakabayashi and R. Ďurikovič. Modeling bonsai tree using positional information, Joint Convention Record of Tohoku Chapter of the Electrical and Information Engineers, No. 2I19, Yonezawa, Japan, pages 341, 2002.[pdf]

Lesson09 "Applied computational topology"

Lecture notes: [pdf]

Solving problems 7P 1~7

Lesson10 "Surface classification via topological surgery"

Lecture notes: [pdf]

Lesson11 "Surface classification via topological surgery II"

Lecture notes: [pdf]

Solving problems 8P 1~4

Lesson12 "Aliasing, Antialiasing"

Lecture notes: [pdf]

Lesson13 "Last lecture"

Final exam!

Exercises

teacher: Zuzana Berger Haladová

Thursday 8:10 I9

Evaluation

• 10 * 2p Attendance
• 3 * 15p Homeworks
• 35p Presentation (compulsory)

List of presentations: [[1]]

25.9. Exercise (Durikovic)

Lecture on Tone mapping.

2.10. Introduction, colors

Practically, calculate the (R,G,B) or (X,Y,Z) color channel values for a given spectral radiance <math>L(\lambda)</math>, where <math>\lambda</math> is the wave length. Radiance <math>L(\lambda)</math> is given in the discrete table form for 10 values of <math>\lambda</math>. Practice the color conversion from (X,Y,Z) to (R,G,B) and (L,a,b) color systems. Those color systems are the industry standards. Calculate the Lightness from a given color in three channels (R,G,B). Notes: [pdf] Additional Materials: Table of measured values for L, X,Y,Z [pdf]

9.10. HDR, Tonemapping

Convert RGB values to .exr and .hdr format. Examples of global tonemapping (Tumblin & Rushmeier) and local tonemapping (Durand). Notes: [pdf]

16.10. F-rep, 1. Homework

Create F-rep of a cube. 1. Homework: HDR ([pdf]) Deadline: 29.10. Send source code + .exe to: zhaladova@gmail.com

23.10. Metamorphosis, Student presentation

30.10. Marching cubes, Student presentation

Marching cubes, see http://www.sccg.sk/~haladova/Cubes.jpg

6.11. Solving problems from homework, Student presentation

Solving problems from homework: http://www.sccg.sk/~durikovic/classes/MRT/c-top07.pdf

13.11. 2. Homework, Student presentation

2. Homework: Affine transforms([pdf]) Deadline: 27.11.

20.11. Solving problems from homework, Student presentation

Solving problems from homework: http://www.sccg.sk/~durikovic/classes/MRT/c-top08.pdf pdf

27.11. 3. Homework, Euler characteristic

Count number of triangles, vertices, edges and compute Euler characteristic and genus of surface. 3. Homework: Perlin noise([pdf]) Deadline: 11.12.

4.12. Canonical fundamental diagram, Student presentation

Construction of planar model and transformation to canonical fundamental diagram.

11.12. Collision detection