IIT Madras · Computer Science
ACM Summer School on Geometric Algorithms and their Applications,2019 - Bhubaneswar
38 free video lectures
38 video lectures. Topics: Introduction to Computational Geometry; Convex hull; Quick hull; Plane sweep algorithm; Voronoi Diagram - I; Convex Geometry - I; Convex Geometry - II; Incidence Geometry - I; Incidence Geometry - II; Polygon Triangulation; Geometric and Abstract Simplicial Complexes…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Introduction to Computational Geometry
- Convex hull
- Quick hull
- Plane sweep algorithm
- Voronoi Diagram - I
- Convex Geometry - I
- Convex Geometry - II
- Incidence Geometry - I
- Incidence Geometry - II
- Plane sweep algorithm
- Polygon Triangulation
- Geometric and Abstract Simplicial Complexes
- Convex Polytopes and Polyhedra
- Art Gallery Theorem
- Smallest Enclosing Disc
- Point Hyperplane Duality
- Voronoi Diagrams and Delaunay triangulations - I
- Voronoi Diagrams and Delaunay triangulations - II
- Point Location
- Range Searching (KD Tree)
- Range Searching (Range Tree)
- Visibility Graph and motion planning
- Geometric Approximation: The Shifting Strategy, Hochbaum and Mass, 1984
- Application of incidence geometry in combinatorics
- Robot motion planning and visibility
- Reeb Graph Introduction and Morse Theory basics
- Reeb Graph Properties
- Reeb Graph Algorithms, Applications
- Arrangements - I
- Linear Programming
- Arrangements - II
- Zone Theorem and Application
- Randomized Incremental Construction - I
- Randomized Incremental Construction - II
- VC-dimension, Epsilon-nets, LP-based approximation for Geometric Covering
- Quasi-uniform Sampling for Weighted Covering Problems.
- Local Search for Packing and Covering
- PTAS via Local Search - I
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Madras.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights