Data Structures for Computer Graphics

The course cannot be taken simultaneously with:

Data Structures for Computer Graphics (A4M39DPG)

The course is a substitute for:

Data Structures in Computer Graphics (36DPG)

Lecturer:

Vlastimil Havran (gar.)

Tutor:

Vlastimil Havran (gar.)

Supervisor:

Department of Computer Graphics and Interaction

Synopsis:

The main topic of the lectures are 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 neighbour search, ray shooting, z-buffer based visibility algorithms and collision detection. The students will have their own projects.

Requirements:

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

More information at webpage:

http://edux.feld.cvut.cz/courses/X39DPG/

Syllabus of lectures:

1. Lectures overview, review of sorting and searching, review of computer graphics algorithms, questions to the course, rules of the game. Introduction to hierarchical and regular data structures used in CG

2. Incidence operations used in computer graphics

3. Point based representations and data structures

4. Object based and image based representations in 2D and 3D

5. Proximity search and its applications I.

6. Proximity search and its application II.

7. High-dimensional search algorithms.

8. Ray shooting and its applications I.

9. Ray shooting and its applications II.

10. Visibility algorithms based on z-buffer I.

11. Static collision detection.

12. Advanced collision detection.

13. Reserved.

Syllabus of tutorials:

1. Introduction to the exercises, description of homework projects

2. Selection of homework projects + consultation

3. Examples of incidence operations

4. Consultation to homework projects

5. Project presentation (4 participants)

6. Project presentation (4 participants)

7. Presentations (4 participants)

8. Consultations to homework projects

9. Written test for 60 minutes (plus perhaps some presentations)

10. Project presentation (4 participants)

11. Project presentations (4 participants)

12. Demonstration and evaluation of the projects (10x)

13. Demonstration and evaluation of the projects (10x)

Study Objective:

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.

Study materials:

1. Samet, H: The Design and Analysis of Spatial Data Structures, Addison Wesley 1994.

2. Samet, H: Applications of Spatial Data Structures, Addison Wesley, 1990.

3. Laurini, R. and Thompson D.: Fundamentals of Spatial Information Systems, Academic Press 1992.

4. Samet, H: Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann Publishers, 2006.

5. E. Langetepe and G. Zachmann: Geometric Data Structures for Computer Graphics, 2006.

6. C. Ericson: Real Time Collision Detection, Morgan Kauffman Publishers, 2005.

7. G. van den Bergen: Collision Detection in Interactive 3D Environments, Elsevier, 2004.

8. D. P. Mehta and S. Sahni: Handbook of Data Structures and Applications, Chapman and Hall/CRC, 2004

Note:

Further information:

http://edux.feld.cvut.cz/courses/A4M39DPG/

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon	roomKN:E-107 Havran V. 11:00–12:30 (lecture parallel1) Karlovo nám. Zengerova posluchárna K1roomKN:E-127 Havran V. 18:00–19:30 (lecture parallel1 parallel nr.101) Karlovo nám. Kotkova cvičebna K4
Tue
Fri
Thu
Fri

The course is a part of the following study plans:

• Computer Technology - Computer Graphics- structured studies (compulsory course of the branch)