Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Algorithms in Digital Cartography

The course is not on the list Without time-table
Code Completion Credits Range Language
153ADK Z,ZK 4 2P+2C Czech
Lecturer:
Tutor:
Supervisor:
Department of Geomatics
Synopsis:

Algorithms and procedures relating to the acquisition, analysis and storage of spatial data. Theoretical foundation of computational geometry, overview of the most commonly used algorithmic techniques in digital cartography: serch points queries, 2D convex hulls, 2D/2.5D triangulations, data-dependent triangulations, digital terrain models and their analysis, Voronoi diagrams, straight skeleton, cartographic generalization algorithms, boolean operations and polygons, Minkowski sum.

Requirements:
Syllabus of lectures:
Syllabus of tutorials:
Study Objective:

Students will get knowledge on selected parts of computational geometry, especially on algorithmic techniques in digital cartography, and will be able to implement 2D/3D algorithms in C++ language.

Study materials:

de Berg, van Kreveld, Overmars M., Schwarzkopf O.: Computational Geometry, Springer, 2000.

Rourke O.J.:Computational geometry in C, Cambridge University Press, 2005.

Bayer T.: Algoritmy v digitální kartografii, UK v Praze, 2008.

Žára J.a kol.: Modernní počítačová grafika, Computer Press, 2004.

Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2020-04-08
For updated information see http://bilakniha.cvut.cz/en/predmet1100306.html