Course detail

Computer Graphics

FSI-2PGAcad. year: 2024/2025

The course familiarises students with basic principles of geometric shape computer modelling and basic algorithm of computer graphics. Acquired knowledge is a precondition for successful work with CAD systems.
Lecture summary:
2-D modelling: explicit, parametric and polar curves, Ferguson, Beziere and Coons curves, basic plane transforms and their composition, modelling of rolling motion.
3-D modelling: parallel and perpendicular projection, linear perspective. Explicit, parametric and polar surfaces. Beziere and Coons surfaces and their connection. Surfaces defined by border. Space figure realistic representation, hide algorithm, constant shading. edge, surface
and volume modelling, curves, surfaces and solids operations, sweep modelling.

Language of instruction

Czech

Number of ECTS credits

2

Mode of study

Not applicable.

Guarantor

doc. Ing. Pavel Štarha, Ph.D.

Department

Institute of Mathematics (ÚM)

Entry knowledge

Students are expected to be familiar with basic terms of 3D geometry, basic problems of 3D geometry,
hyve basic knowledge of projection methods (Monge and orthographic projection) and a grasp of language Pascal and Borland Delphi environment.

Rules for evaluation and completion of the course

Requirements of credit obtainning: graphic program constructed in Borland DELPHI
environment, machine part graphic model constructed in v Rhinoceros.


Missed lessons may be compensated for via a written test.

Aims

Students will apply the knowledge acquired in mathmatics and descriptive geometry. This knowledge will be extended by understanding of technical curves and surfaces, students will gain skills necessary for the work with a professional graphic system. 


Students will apply the knowledge acquired in mathmatics and descriptive geometry. This knowledge will be extended by understanding of technical curves and surfaces, students will gain skills necessary for the work with a professional graphic system (Rhinoceros). They will be made familiar with algorithm building and with Borland DELPHI environment, as well as programming of basic graphics systems.

Study aids

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Martišek, D.: Matematické principy grafických systémů, Littera, Brno 2002
Martišek, D.: Počítačová geometrie a grafika, VUTIUM, Brno 2000

Recommended reading

Martišek, D.: Matematické principy grafických systémů, Littera, Brno 2002
Martišek, D.: Počítačová geometrie a grafika, VUTIUM, Brno 2002

Classification of course in study plans

  • Programme B-MET-P Bachelor's 1 year of study, summer semester, elective

Type of course unit

 

Computer-assisted exercise

26 hod., compulsory

Teacher / Lecturer

doc. Ing. Pavel Štarha, Ph.D.

Syllabus

1. Rhinoceros system: environment, co-ordinate system, cursor control, system setting.
2. Rhinoceros system: elements of edge modelling, edge perations.
3. Rhinoceros system: colours and their editting, colour system RGB  and CMY (Paint Brush). Files control. Elements of surface modelling.
4. Rhinoceros system: Zoom, Fit to Window, Snap Toolbox. BORLAND DELPHI: Environment, simple program (RGB cube cut).
5. Rhinoceros system: Curves and surfaces operations. BORLAND DELPHI: Curve constructions – self algorithm of curves construction
6. Rhinoceros system: Elements of volume modelling, volume elements operations, visualisation commands: Hide, Shade. Material, Light Source. BORLAND DELPHI: Plane transforms.
7. Rhinoceros system: Selection and blocks. Extruding and sweeping, Info Box. BORLAND DELPHI: Modelling of technical motions
8. Rhinoceros system: Work with blocks. Revision, assignment of semester work. BORLAND DELPHI: Technical curves in plane.
9. Rhinoceros system: Semester work processing. BORLAND DELPHI: Edge Models of elementary surfaces and solids in parallel and orthographic projection.
10. Rhinoceros system: Semester work processing. BORLAND DELPHI: Edge models of technical surfaces.
11. Rhinoceros system: Semester work processing. BORLAND DELPHI: Visibility algorithms.
12.- 14. Semester work processing.

Presence in the seminar is obligatory.