Learn · ACM Summer School on Geometric Algorithms and their Applications,2019 - Bhubaneswar
Lecture 34 of 38ACM Summer School on Geometric Algorithms and their Applications - NISER Bhubaneswar
Randomized Incremental Construction - II
IIT Madras
Credits and licence
- From
- ACM Summer School on Geometric Algorithms and their Applications,2019 - Bhubaneswar, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the 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