Starting a new Lecture Notes Series on Computer - Computational Geometry
.png)
.png)
Youtube Lecture Playlist CreditsChannel Name: nptelhrd
So Let Us Start to This Journey of Learning
Computer - Computational Geometry By Lecture Notes together!
Lecture 1: Mod-01 Lec-01 Introduction
Lecture 2: Mod-01 Lec-02 Visibility Problems
Lecture 3: Mod-02 Lec-03 2D Maxima
Lecture 4: Mod-03 Lec-04 Line Sweep Method
Lecture 5: Mod-03 Lec-05 Segment Intersection Problem
Lecture 6: Mod-03 Lec-06 Line Sweep: Rectangle Union
Lecture 7: Mod-04 Lec-07 Convex Hull
Lecture 8: Mod-04 Lec-08 Convex Hull Contd
Lecture 9: Mod-04 Lec-09 Quick Hull
Lecture 10: Mod-04 Lec-10 More Convex Hull Algorithms
Lecture 13: Mod-06 Lec-13 Lower Bounds
Lecture 14: Mod-07 Lec-14 Planar Point Location
Lecture 16: Triangulation of Arbitrary Polygon.
Lecture 17: Mod-08 Lec-17 Voronoi Diagram : Properties
Lecture 18: Mod - 08 Lec-18 Voronoi Diagram Construction
Lecture 19: Mod-08 Lec-19 Delaunay Triangulation.
Lecture 20: Mod-09 Lec-20 Quick sort and Backward Analysis
Lecture 21: Mod-09 Lec-21 Generalized RIC
Lecture 22: Mod-09 Lec-22 RIC Continued
Lecture 23: Mod-10 Lec-23 Arrangements
Lecture 24: Mod-10 Lec-24 Zone Theorem and Application
Lecture 25: Mod-10 Lec-25 Levels
Lecture 26: Mod-11 Lec-26 Range Searching : Introduction
Lecture 27: Mod-11 Lec-27 Orthogonal Range searching
Lecture 28: Mod-11 Lec-28 Priority Search Trees
Lecture 29: Mod-11 Lec-29 Non - Orthogonal Range Searching
Lecture 30: Mod-11 Lec-30 Half - Plane Range Query
Lecture 31: Mod-12 Lec-31 Well Separated Partitioning
Lecture 32: Mod-12 Lec-32 Quadtrees Epsilon -WSPD
Lecture 33: Mod-12 Lec-33 Construction of Epsilon - WSPD
Lecture 35: Mod-13 Lec-35 Epsilon-Nets & VC Dimension
Lecture 36: Mod-13 Lec-36 Epsilon-Nets & VC Dimension contd
Lecture 37: Mod-13 Lec-37 Geometric Set Cover
Lecture 39: Mod-14 Lec-39 Shape Representation
Lecture 40: Mod-14 Lec-40 Shape Comparison