Computational Geometry (Geometriske Algoritmer) “the pizza meeting” Kim Skak Larsen IMADA University of Southern Denmark kslarsen@imada.sdu.dk May 15, 2018 Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 1 / 25
Overview Why an Independent Subject? 1 Example Topics 2 Applications 3 Formal Details 4 Disclaimer 5 Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 2 / 25
One-Dimensional Data Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 3 / 25
One-Dimensional Data Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 4 / 25
Two-Dimensional Data Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 5 / 25
Two-Dimensional Data Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 6 / 25
Two-Dimensional Data Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 7 / 25
Two-Dimensional Data Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 8 / 25
Convex Hull Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 9 / 25
Convex Hull Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 10 / 25
Dynamic Convex Hull Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 11 / 25
Dynamic Convex Hull Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 12 / 25
Dynamic Convex Hull Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 13 / 25
Triangulations Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 14 / 25
Nice Triangulations Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 15 / 25
Range Searching Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 16 / 25
Range Searching Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 17 / 25
Range Searching Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 18 / 25
Range Searching Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 19 / 25
Example Applications Geometric algorithms are important parts of: Computer Graphics Geographic Information Systems (GIS) Robot Motion Planning Design: CAD, VLSI, . . . Image Analysis Computer Games Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 20 / 25
Course Content Algorithms and Data Structures for Geometric Objects Triangulations and Voronoi Diagrams Interval and Point Searches Convex Hulls Range Searching Motion Planning etc. Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 21 / 25
Course Content Introduction to (continuation of) important general techniques: Line Sweeping Fractional Cascading Randomization Amortization Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 22 / 25
Prerequisites Analysis of Algorithms and Data Structures (DM507 + DM553, or equivalent) Search Trees Divide and Conquer Asymptotic Notation Time and Space Analysis Correctness Analysis Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 23 / 25
Format 10 ECTS over one semester Obligatory assignment in parts (some individual) Oral exam 2h lectures, 2h discussion section per week Good book: Computational Geometry Algorithms and Applications, 3. eds. de Berg, Cheong, van Kreveld, Overmars Springer, 2008. Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 24 / 25
Disclaimer Chalk & blackboard lectures. . . Core algorithmic problems (not graphics and games) Focus on efficient algorithms – O ( n log n ) This is not math! But there will be proofs in every lecture (of correctness and complexity) Course language is English, if necessary Kim Skak Larsen (CS, IMADA) Elective Courses Presentation May 15, 2018 25 / 25
Recommend
More recommend