Computational Geometry

Overview Contents: Introduction using basic visibility problems : Introduction,Visibility problems 2D Maxima - The plane sweep technique and applications - The plane sweep technique and application - Convex hull different paradigms and quickhull - Dual transformation and applications - Lower bounds on algebraic tree model - Point location and triangulation - Voronoi diagram and delaunay triangulation - Randomized incremental construction and random sampling - Arrangements and levels - Range searching - Clustering point sets using quadtrees and applications - E-nets VC dimension and applications - Shape analysis and shape comparison

Beginner 0(0 Ratings) 0 Students enrolled English
Created by skill expert
Last updated Sat, 18-Jun-2022
+ View more
Course overview
Lecture Details

Computational Geometry by Prof. Sandeep Sen, Department of Computer Science & Engineering, IIT Delhi. For more details on NPTEL visit httpnptel.iitm.ac.in

Curriculum for this course
38 Lessons 34:34:24 Hours
Lecture
38 Lessons 34:34:24 Hours
  • Introduction
    00:47:42
  • Visibility Problems
    00:52:05
  • 2D Maxima
    00:52:48
  • Line Sweep Method
    01:00:36
  • Segment Intersection Problem
    00:54:28
  • Line Sweep Rectangle Union
    00:59:47
  • Convex Hull
    00:52:35
  • Convex Hull Contd I
    00:55:28
  • Quick Hull
    00:54:44
  • More Convex Hull Algorithms
    00:54:09
  • Intersection of Half Planes and Duality
    00:52:27
  • Intersection of Half Planes and Duality Contd I
    00:55:25
  • Lower Bounds
    00:55:53
  • Planar Point Location
    00:58:23
  • Point Location and Triangulation
    00:51:45
  • Voronoi Diagram Properties
    00:56:10
  • Delaunay Triangulation.
    00:57:11
  • Quick sort and Backward Analysis
    00:56:07
  • Generalized RIC
    00:42:25
  • RIC Continued
    00:38:38
  • Arrangements
    01:00:28
  • Zone Theorem and Application
    00:52:56
  • Levels
    00:59:20
  • Range Searching Introduction
    00:55:36
  • Orthogonal Range searching
    00:51:56
  • Priority Search Trees
    00:51:34
  • Non - Orthogonal Range Searching
    00:55:40
  • Half - Plane Range Query
    01:03:54
  • Well Separated Partitioning
    00:53:50
  • Quadtrees Epsilon -WSPD
    00:49:20
  • Construction of Epsilon - WSPD
    00:57:23
  • Epsilon - WSPD to Geometric Spanner
    00:59:33
  • Epsilon-Nets & VC Dimension I
    00:51:43
  • Epsilon-Nets & VC Dimension contd II
    00:58:03
  • Geometric Set Cover
    00:57:12
  • Geometric Set Cover (with Bounded VC Dimension)
    00:48:02
  • Shape Representation
    01:10:16
  • Shape Comparison I
    00:48:52
+ View more
Other related courses
34:30:27 Hours
Tools in Scientific Computing
Updated Wed, 08-Jun-2022
0 0 Free
27:10:39 Hours
Artificial Intelligence Search Methods for problem Solving
Updated Wed, 08-Jun-2022
0 0 Free
20:48:51 Hours
Introduction to R Software
Updated Wed, 08-Jun-2022
0 0 Free
07:24:45 Hours
Introduction to parallel Programming in Open MP
Updated Fri, 10-Jun-2022
0 0 Free
39:26:26 Hours
Design of Digital Circuits and Computer Architecture
Updated Fri, 10-Jun-2022
0 0 Free
About instructor

skill expert

0 Reviews | 18 Students | 467 Courses
Student feedback
0
0 Reviews
  • (0)
  • (0)
  • (0)
  • (0)
  • (0)

Reviews

Free
Get enrolled
Includes: