x
Menu

Computational Geometry

IIT Delhi, , Prof. Sandeep Sen

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

Includes

Lecture 1: Introduction

4.1 ( 11 )


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

Ratings

3.1


7 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send