Algorithms in Digital Cartography

Lecturer:

Tomáš Bayer (gar.), Tomáš Bayer

Tutor:

Tomáš Bayer (gar.), Tomáš Bayer

Supervisor:

Department of Mapping and Cartography

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:

Time-table for winter 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
Tue	roomTH:B-870 Bayer T. 08:00–09:50 (lecture parallel1 parallel nr.468) Thákurova 7 (FSv-budova A) B870roomTH:B-870 Bayer T. 10:00–11:50 (lecture parallel1) Thákurova 7 (FSv-budova A) B870
Fri
Thu
Fri

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans: