'Visibility Problems' Video Lecture

Visibility Problems

Discipline: Computer Science and Engineering

Faculty: Prof. Sandeep Sen

Institute: IIT Delhi

Visibility Problems - Click on the Video Link shown below to play the video on Youtube. Browse through Computational Geometry (Computer Science and Engineering) Video Lectures by Prof. Sandeep Sen from IIT Delhi through NPTEL.

NEXT LECTURE >> 2D Maxima

Download this video in MP4, FLV & 3GP formats

Format	Size	Download
MP4	414 MB	MP4 Video Download Link 1
MP4	414 MB	MP4 Video Download Link 2
FLV	124 MB	FLV Video Download Link 1
FLV	124 MB	FLV Video Download Link 2
3gp	56 MB	3gp Video Download Link 1
3gp	56 MB	3gp Video Download Link 2

Search Courses by Discipline & Institute

Search Courses

Course Video 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 Dimensio.. Shape Representation Shape Comparison