FPF:UINA335 Comp. Geometry and Computer Gr - Course Information

UINA335 Comp. Geometry and Computer Graphics II

Extent and Intensity

2/2/0. 6 credit(s). Type of Completion: zk (examination).

Teacher(s)

doc. RNDr. Luděk Cienciala, Ph.D. (lecturer)
doc. RNDr. Luděk Cienciala, Ph.D. (seminar tutor)

Guaranteed by

doc. RNDr. Luděk Cienciala, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava

Prerequisites

UINA334 Comp. Geometry and Computer Gr
Computer graphics in 2D.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Computer Science and Technology (programme FPF, N1801 Inf)

Course objectives

Follows the subject Computational Geometry and Computer Graphics I. Content of the course is in 3D computer graphics, basic algorithms, basic geomterie used in computer graphics.

Syllabus

• 1. Basics of graphical - Building blocks boundary representation: polygonal representation - reducing the number of triangles, expression and basic properties of parametric surfaces - Bezier surfaces, B - spline surfaces, contours set of parallel cuts - representation of contours, implicit surfaces - implicit functions, and mixing functions coefficient ci, rendering implicit surfaces.
    
  2. Representation of the bodies: boundary representation bodies - vertices, edges and walls arc representation, simple land surface representation, structured representation of land surface, patterning - ruled surfaces, rotating patterning, quantifying availability of space and octal trees, constructive solid geometry - CSG primitives, convert CSG tree to the other representations.
     
  3. The volume-representation bodies and multi-dimensional data: the grid - dimensionality domain and type of samples, data resolution, three-dimensional objects and data in discrete grid - basic volume element (voxel and cell), topology, topology and digital connection, multivariate data samples and non-scalar, the transfer of three-dimensional volume data on triangles - Marching Cubes algorithm, algorithm Marching tetrahedra, Dividing Cubes algorithm.
     
  4. Procedural Modeling: fractal geometry - fractal dimension, fractal, linear deterministic fractals, fractals statistical, statistical fractals in higher dimensions, coastlines, mountains, clouds, stones and fractal planets, systems of particles.
     
  5. Screening: parallel projection, central projection, viewing frustum, viewing transformations.
     
  6. Light: theory of light, illuminating model - physically based lighting models, empirical models, lighting, refraction, volumetric lighting in the representation of a system of particles - derivation of the integral imaging volume, light sources - point source, parallel light source, area source, reflktor , chart, sky, shading - constant shading, Gouraud shading, Phong shading.
     
  7. Solution visibility: data preprocessing, linear algorithms visibility, raster algorithms visibility - memory depth, line memory depth, painter algorithm, split screen, displaying spatial graphs, displaying volumes - not seeking surface methods, simple display surface, the display surface normal.
     
  8. Shadows - cutting surface, shadow body, the shadow memory depth.

Literature

recommended literature
• Klawonn, F. Introduction to Computer Graphics: Using Java 2D and 3D. Springer, 2012. ISBN 9781447127321. info
• Sarfraz, M. Interactive Curve Modeling: With Applications to Computer Graphics, Vision and Image Processing. Springer, 2010. ISBN 9781849966634. info
• Mark de Berg a kol. Computational Geometry: Algorithms and Applications. Springer, 2008. ISBN 9783540779735. info
• Agoston, K., M. Computer Graphics and Geometric Modelling: Implementation & Algorithms. Springer, 2005. ISBN 9781852338183. info
• Egerton, P. A., Hall, W. S. Computer Graphics - Mathematical first steps. Pearson Education, 1999. info
• ŽÁRA, J., BENEŠ, B., FENKEL, P. Moderní počítačová grafika. Brno Computer Press, 1998. ISBN 80-7226-049-9. info
• Hudec, J. Algoritmy počítačové grafiky. Praha, ČVUT, 1997. info
• Granát, L., Selechovský, H. Počítačová grafika. Praha, ČVUT, 1995. info
• Drs, L., Ježek, F., Novák, J. Počítačová grafika. Praha, ČVUT, 1995. info
• Sobota, B. Počítačová grafika a jazyk C. České Budějovice, KOOP, 1995. info
• Žára, J., Sochor, J. Algoritmy počítačové grafiky. ČVUT Praha, 1993. info
• Skála, V. Světlo, barvy a barevné systémy v počítačové grafice. Praha, ČVUT, 1993. info
• Drdla, J. Metody modelování křivek a ploch v počítačové geometrii. Olomouc, UP, 1992. info
• Slavík, P. Metody zpracování grafické informace. Praha, ČVUT, 1992. info
• Poláček, J., Ježek, G., Kopincová, E. Počítačová grafika. Praha, 1991. info
• Heinz-Otto Leitgen, Peter H. Richter. The Beauty of Fractals. Springer, 1986. ISBN 9783540158516. info
• Drs, L. Plochy ve výpočetní technice. Praha, ČVUT, 1984. info

Teaching methods

Interactive lecture
Lecture with a video analysis

Assessment methods

Exam

Language of instruction

English

Further comments (probably available only in Czech)

The course can also be completed outside the examination period.

Teacher's information

Credit: full-time students wrote the exercises two credit tests scored more than 30 points per test. The first test consists of three parts: a theoretical part (10 points), the numerical part (10 points) and a practical part (10 points). The second test consists of two parts: a theoretical part (20 points) and a practical part (10 points). A necessary condition for the exam is registation to the date of the final test at: http://axpsu.fpf.slu.cz/ ~ cie10ui/index.php. The students can get bonus points (maximum 10 points) - for submission of practical tasks the day of the exercise, to which the job is submitted or for solving complex computational problems. Each student prepares a specified project, which is rated up to 30 points. Submission of the project is a necessary condition for the granting of credit. On the selected project can sign a maximum of two full-time students the second week of the semester of the academic year and at: http://axpsu.fpf.slu.cz/ ~ cie10ui/index.php. The deadline of submission of the project is midterm week of the semester. For every further week, the maximum number of points that a student can get for the project, reduced by 50 percent. The project includes a user manual, which describes the procedures used, algorithms. The credit is necessary to obtain total (2 + test project) 55 points.
Exam: The exam exam can get 70 points. For the successful completion you need to get at least 35 points. Mark is determined by adding the points for the exam and points that the student earned during the semester.

• Enrolment Statistics (Summer 2019, recent)
  
• Permalink: https://is.slu.cz/course/fpf/summer2019/UINA335