This page is located in archive.

This subject is delivered by Department of Computer Graphics and Interaction.


The main topic is the data structures used in computer graphics. The basic and hierarchical data structures over point and object data will be addressed. The focus of the lectures and exercises is nearest and k-nearest neighbor search, ray shooting, z-buffer based visibility algorithms and collision detection. The students will have their own projects. The project has the official sylabus and schedule

Goals of study

Students will acquire credits on the basis of term project and it consists of achieved results, the source code documentation, project presentation and the project functionality. There will be a written test in the term. The extent of the exam is given by contents of lectures.


Space and runtime complexity of algorithms, binary trees and heaps, tree balancing, search algorithms, priority queues, fundamentals of von Neumann architecture.


sorting, searching, multidimensional data structures, objects representations, ray shooting, ray tracing, visibility computations, visibility culling, collision detection.

courses/a4m39dpg/annotation/start.txt · Last modified: 2016/02/22 10:31 by havravla