Computational Geometry

Video Lecture Description	Sub-Category	Time	Click to view video
	Mod-01 Lec-01 Introduction	Computer Science	48 min	Click to view videos
	Mod-01 Lec-02 Visibility problems	Computer Science	52 min	Click to view videos
	Mod-01 Lec-03 2D Maxima	Computer Science	53 min	Click to view videos
	Mod-02 Lec-04 Line sweep method	Computer Science	61 min	Click to view videos
	Mod-03 Lec-05 Segment intersection problem	Computer Science	54 min	Click to view videos
	Mod-03 Lec-06 Line sweep contd	Computer Science	60 min	Click to view videos
	Mod-04 Lec-07 Convex hull	Computer Science	53 min	Click to view videos
	Mod-04 Lec-08 Convex hull contd	Computer Science	55 min	Click to view videos
	Mod-04 Lec-09 Quick hull	Computer Science	55 min	Click to view videos
	Mod-04 Lec-10 Quick hull algorithm	Computer Science	54 min	Click to view videos
	Mod-05 Lec-11 Intersection of half planes	Computer Science	52 min	Click to view videos
	Mod-05 Lec-12 Intersection of half planes contd	Computer Science	55 min	Click to view videos
	Mod-06 Lec-13 Lower bounds	Computer Science	56 min	Click to view videos
	Mod-07 Lec-14 Point location	Computer Science	58 min	Click to view videos
	Mod-07 Lec-15 Location and triangulation	Computer Science	52 min	Click to view videos
	Mod-08 Lec-16 Voronoi diagrams searching	Computer Science	52 min	Click to view videos
	Mod-08 Lec-17 Voronoi diagram	Computer Science	56 min	Click to view videos
	Mod-09 Lec-18 Triangulation of arbitrary polygon	Computer Science	60 min	Click to view videos
	Mod-09 Lec-19 Delaunay triangulation	Computer Science	57 min	Click to view videos
	Mod-09 Lec-20 Randomized incremental construction	Computer Science	56 min	Click to view videos
	Mod-09 Lec-21 Randomized incremental construction contd	Computer Science	43 min	Click to view videos
	Mod-09 Lec-22 Randomized incremental construction cont	Computer Science	39 min	Click to view videos
	Mod-10 Lec-23 Arrangements	Computer Science	60 min	Click to view videos
	Mod-10 Lec-24 Arrangements contd	Computer Science	53 min	Click to view videos
	Mod-10 Lec-25 Arrangements cont	Computer Science	59 min	Click to view videos
	Mod-11 Lec-26 Range searching	Computer Science	56 min	Click to view videos
	Mod-11 Lec-27 Range searching contd	Computer Science	52 min	Click to view videos
	Mod-11 Lec-28 Priority search trees	Computer Science	52 min	Click to view videos
	Mod-11 Lec-29 Range searching 2	Computer Science	56 min	Click to view videos
	Mod-11 Lec-30 Range searching half plane	Computer Science	64 min	Click to view videos
	Mod-12 Lec-31 Well separated partitioning	Computer Science	54 min	Click to view videos
	Mod-12 Lec-32 Quadtrees EWSPD	Computer Science	55 min	Click to view videos
	Mod-12 Lec-33 Construction of EWSPD	Computer Science	57 min	Click to view videos
	Mod-12 Lec-34 EWSPD Construction	Computer Science	60 min	Click to view videos
	Mod-13 Lec-35 E Nets & VC Dimension	Computer Science	52 min	Click to view videos
	Mod-13 Lec-36 E Nets & VC Dimension contd	Computer Science	58 min	Click to view videos
	Mod-13 Lec-37 Geometric set cover	Computer Science	57 min	Click to view videos
	Mod-13 Lec-38 Geometric set cover contd	Computer Science	48 min	Click to view videos
	Mod-14 Lec-39 Shape representation	Computer Science	70 min	Click to view videos
	Mod-14 Lec-40 Shape comparison	Computer Science	49 min	Click to view videos