DM819 - Computational Geometry

Home Exam ☰

Lectures and Exercises

Due to integration with the platform "itslearning", this page is organized into topics, which are sorted according to the date of the first lecture of the topic and the later exercises are placed under the topic they belong to. Thus, if one looks at all the dates of lectures and exercises, one will not find an ordered list.

The entries are not static - announced material for a lecture may be updated to what was actually covered after the lecture was given. At the end of the course, the lecture and exercises announcements on this page will reflect exactly what was covered.

Date	Time	Place	Event
Introduction, goals & techniques. Convex Hull. Euler's Theorem.
2/2	8-10	Zoom	Lecture
9/2	8-10	Zoom	Exercises
Plane Sweep Algorithms. Line Segment Intersection.
3/2	10-12	Zoom	Lecture
16/2	8-10	Zoom	Exercises
Polygon Triangulation.
10/2	10-12	Zoom	Lecture
23/2	8-10	Zoom	Exercises
Linear Programming. Backwards Analysis.
17/2	10-12	Zoom	Lecture
2/3	8-10	Zoom	Exercises
Orthogonal Range Searching: k-d Trees, Range Trees.
24/2	10-12	Zoom	Lecture
9/3	8-10	Zoom	Exercises
Point Location: Trapezoidal Maps.
3/3	10-12	Zoom	Lecture
16/3	8-10	Zoom	Exercises
Voronoi Diagrams.
10/3	10-12	Zoom	Lecture
23/3	8-10	Zoom	Exercises
Windowing Queries: Interval Trees, Priority Search Trees, Segment Trees.
17/3	10-12	Zoom	Lecture
24/3	10-12	Zoom	Lecture
6/4	8-10	Zoom	Exercises
Binary Space Partitions.
7/4	10-12	Zoom	Lecture
13/4	8-10	Zoom	Exercises
Quadtrees.
14/4	10-12	Zoom	Lecture
20/4	8-10	Zoom	Exercises
Robot Motion Planning and Visibility Graphs.
21/4	10-12	Zoom	Lecture
27/4	8-10	Zoom	Exercises
Algorithmic Foundations.
28/4	10-12	Zoom	Lecture

Data protection at SDU ▪ Databeskyttelse på SDU