Learn · Computational Geometry
Lecture 37 of 40Epsilon-Nets VC Dimension and Applications
Geometric Set Cover
Prof. Amit Kumar · IIT Delhi
Credits and licence
- From
- Computational Geometry, IIT Delhi (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
- Visibility Problems
- 2D Maxima
- Line Sweep Method
- Segment Intersection Problem
- Line Sweep: Rectangle Union
- Convex Hull
- Convex Hull Contd
- Quick Hull
- More Convex Hull Algorithms
- Intersection of Half Planes and Duality
- Intersection of Half Planes and Duality Contd
- Lower Bounds
- Planar Point Location
- Point Location and Triangulation Contd...
- Triangulation of Arbitrary Polygon.
- Voronoi Diagram : Properties
- Voronoi Diagram Construction
- Delaunay Triangulation.
- Quick sort and Backward Analysis
- Generalized RIC
- RIC Continued
- Arrangements
- Zone Theorem and Application
- Levels
- Range Searching : Introduction
- Orthogonal Range searching
- Priority Search Trees
- Non - Orthogonal Range Searching
- Half - Plane Range Query
- Well Separated Partitioning
- Quadtrees Epsilon -WSPD
- Construction of Epsilon - WSPD
- Epsilon - WSPD to Geometric Spanner
- Epsilon-Nets & VC Dimension
- Epsilon-Nets & VC Dimension contd
- Geometric Set Cover
- Geometric Set Cover (with Bounded VC Dimension)
- Shape Representation
- Shape Comparison