Course detail

Computer Graphics II

FAST-GE53Acad. year: 2012/2013

Object oriented programming principle, application in the environment Borland Delphi.
Algorithmes in computer graphics.
Application theory of graphs in computer graphics. Presentation of graphs in data structures. Graphs alogorithmes (minimum cord and path in graph).
Principles of 3D graphics (representation CGS, octan tree).
Realization of algotithmes in the environment Borland Delphi.

Language of instruction

Czech

Number of ECTS credits

Mode of study

Not applicable.

Guarantor

doc. Ing. Dalibor Bartoněk, CSc.

Department

Institute of Geodesy (GED)

Learning outcomes of the course unit

analysis tasks in terms of automation, design of algorithms, creation of a flowchart, diagram transcript in language instructions, program debugging, a separate project in Delphi

Prerequisites

Basic of computer graphics, formats, works in a CAD system

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Teaching methods depend on the teaching methods are described in Article 7 of the Study and Examination Regulations of the University. Teaching theories hold presentations and direct instruction. Practical skills students will acquire the solution of several subtasks and 2 projects. The course will be based on the LMS Moodle.

Assesment methods and criteria linked to learning outcomes

Attendance, submission of laboratory reports, activity in the exercises, written tests, submission of final project

Course curriculum

1. Object oriented programming principle.
2. Algorithmes in computer graphics, position of point with respect to segment of a line and traverse, example.
3. Hatching and filling in closed areas, example.
4. Window transformation into view - creation of cutout,example.
5. Theory of graphs. Presentation of graphs in data structures.
6. Minimum cord , application of Boruvka's algorithm in Delphi.
7. Minimum path in graph,application of Dijkstr's algorithm in Delphi.
8. Handling with images, Input from file, change of size and resolution, creation of loop.
9. Principles of 3D graphics.
10.Exapmles in Delphi.

Work placements

Not applicable.

Aims

Algoritmization of task focused on graphics in the envirnment Borland Delphi.

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

Extent and forms are specified by guarantor’s regulation updated for every academic year.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Foley–Dam–Feiner–Hughes-Philips: Computer Graphics: Princ.and Pract.. Addison Wesley, 1995. (EN)
Gonzales, R. C., Woods, R. E.: Digital Image Processing. Addison Wesley, 1993. (EN)
Watt, A., Policarpo F.: The Computer Image. Addison Wesley, 1998.

Recommended reading

Klíma, Bernas, Hozman, Dvořák: Zpracování obrazové informace. Skriptum ČVUT Praha, 1996. (CS)
Šnorek: Technické prostředky poč. grafiky. Skriptum ČVUT Praha, 1996. (CS)
Žára, J., Beneš, B., Felkel, P.: Moderní počítačová grafika. Computer Press, 1998. (CS)

Classification of course in study plans

  • Programme B-P-C-GK Bachelor's

    branch G , 2 year of study, summer semester, elective

  • Programme B-K-C-GK Bachelor's

    branch G , 2 year of study, summer semester, elective

Type of course unit

 

Exercise

26 hod., compulsory

Teacher / Lecturer

doc. Ing. Dalibor Bartoněk, CSc.

Syllabus

Object oriented programming principle, application in the environment Borland Delphi.
Algorithmes in computer graphics.
Application theory of graphs in computer graphics. Presentation of graphs in data structures. Graphs alogorithmes (minimum cord and path in graph).
Principles of 3D graphics (representation CGS, octan tree).
Realization of algotithmes in the environment Borland Delphi.