Course detail

Computer Graphics

FSI-SPGAcad. year: 2018/2019

This course is lectured in winter semester in the second year of mathematical engineering study. It introduces basic principles of algorithms of computer graphics. Lectures provide a theoretical basis of computer graphics - euclidean space graphical data and colour spaces, projective space, transforms, basic properties and construkctions of curves and surfaces, realistic representation of spatial figures, hide and shading algorithm, textures.

Language of instruction

Czech

Number of ECTS credits

3

Mode of study

Not applicable.

Guarantor

doc. PaedDr. Dalibor Martišek, Ph.D.

Department

Institute of Mathematics (ÚM)

Learning outcomes of the course unit

Students will apply the knowledge acquired in theoretical and computer courses. This knowledge will be extended by technical curves and surfaces and real objects, as well as ability to demonstrate technical data in different ways. Students will improve the quality of algorithm construction and Delphi environment knowledge.

Prerequisites

Descriptive geometry, Basic course of algenra, programming techniques and their implementation in Borland Delphi

Co-requisites

Not applicable.

Planned learning activities and teaching methods

The course is taught through exercises which are focused on practical topics presented in lectures.

Assesment methods and criteria linked to learning outcomes

Graded course-unit credit is awarded on condition of having worked out assigned graphic program constructed in Borland DELPHI environment, and semester work – building of a greater graphic program.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

Students will apply the knowledge acquired in mathematical analysis, algebra, geometry and previous courses dealing with computers. Theoretical knowledge will be practically applied when building geometrical models of real systems.

Specification of controlled education, way of implementation and compensation for absences

Missed lessons may be compensated for via a written test.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Foley, van Dam: Computer Graphics, , 0
Martišek, D.: Matematické principy grafických systémů, Littera, Brno 2002

Recommended reading

Martišek, D.: Matematické principy grafických systémů, Littera, Brno 2002

Classification of course in study plans

  • Programme B3A-P Bachelor's

    branch B-MAI , 2 year of study, winter semester, compulsory

Type of course unit

 

Computer-assisted exercise

26 hod., compulsory

Teacher / Lecturer

doc. PaedDr. Dalibor Martišek, Ph.D.

Syllabus

1. Euclidean space. Topologic dimension, curve, surface, solid. Projective space, dividing ratio, cross ratio. Raster graphics. Pixel, colour spaces, RGB cube.

2. 2-D transforms, analytic representation and composition.

3. Analytic curves, algorothms their construction construction. Point function, tangent and normal of curve, curvature. Affine combination, control points, Beziere curves, B-spline curves, NURBS curves.

4. Motion, analytic representation, software modelling. Animation principles.

5. Analytic representation of parallel and orthogonal projection, elementary solids modelling. Analytic surfaces, isolines, tangent plane, normal, normal and Gaussian curvature

6. Basic method of surface modelling, NURBS surfaces.

7. Lighting of elementar solids, lighting models in computer graphics, shading and rendering

8. Lighting models, ray tracing, ray casting.

9. Hausdorff dimension and its measure, fractal. Self-similarity and self-afinity. Random walk method.

10. Statistical self-similarity, midpoint moving method.

11. L-systems

12. 13. Semestral work

Presence in the seminar is obligatory.