EE-Learning
Lower Bounds
Catogry:
Computing
Subject:
Computer Science
Course:
Computational Geometry
Lecture List
Shape Comparison I
Shape Representation
Geometric Set Cover (with Bounded VC Dimension)
Geometric Set Cover
Epsilon-Nets & VC Dimension contd II
Epsilon-Nets & VC Dimension I
Epsilon – WSPD to Geometric Spanner
Construction of Epsilon – WSPD
Quadtrees Epsilon -WSPD
Well Separated Partitioning
Half – Plane Range Query
Non – Orthogonal Range Searching
Priority Search Trees
Orthogonal Range searching
Range Searching : Introduction
Levels
Zone Theorem and Application
Arrangements
RIC Continued
Generalized RIC
Quick sort and Backward Analysis
Delaunay Triangulation.
Voronoi Diagram Construction I
Voronoi Diagram : Properties
Point Location and Triangulation Contd
Planar Point Location
Lower Bounds
Intersection of Half Planes and Duality Contd I
Intersection of Half Planes and Duality
More Convex Hull Algorithms
Quick Hull
Convex Hull Contd I
Convex Hull
Line Sweep: Rectangle Union
Segment Intersection Problem
Line Sweep Method
2D Maxima
Visibility Problems
Introduction