Computational Geometry - IIT_Delhi

1/39 Vidéos

Mod-01 Lec-01 Introduction

IIT_Delhi

00:47:42

2

Mod-01 Lec-02 Visibility Problems

IIT_Delhi

00:52:05

3

Mod-02 Lec-03 2D Maxima

IIT_Delhi

00:52:49

4

Mod-03 Lec-04 Line Sweep Method

IIT_Delhi

01:00:36

5

Mod-03 Lec-05 Segment Intersection Problem

IIT_Delhi

00:54:28

6

Mod-03 Lec-06 Line Sweep: Rectangle Union

IIT_Delhi

00:59:47

7

Mod-04 Lec-07 Convex Hull

IIT_Delhi

00:52:35

8

Mod-04 Lec-08 Convex Hull Contd

IIT_Delhi

00:55:29

9

Mod-04 Lec-09 Quick Hull

IIT_Delhi

00:54:44

10

Mod-04 Lec-10 More Convex Hull Algorithms

IIT_Delhi

00:54:10

11

Mod-05 Lec-11 Intersection of Half Planes and Duality

IIT_Delhi

00:52:28

12

Mod-05 Lec-12 Intersection of Half Planes and Duality Contd

IIT_Delhi

00:55:26

13

Mod-06 Lec-13 Lower Bounds

IIT_Delhi

00:55:54

14

Mod-07 Lec-14 Planar Point Location

IIT_Delhi

00:58:24

15

Mod-07 Lec-15 Point Location and Triangulation Contd...

IIT_Delhi

00:51:45

16

Mod-08 Lec-17 Voronoi Diagram : Properties

IIT_Delhi

00:56:11

17

Mod-08 Lec-18 Voronoi Diagram Construction

IIT_Delhi

00:59:34

18

Mod-08 Lec-19 Delaunay Triangulation.

IIT_Delhi

00:57:13

19

Mod-09 Lec-20 Quick sort and Backward Analysis

IIT_Delhi

00:56:08

20

Mod-09 Lec-21 Generalized RIC

IIT_Delhi

00:42:26

21

Mod-09 Lec-22 RIC Continued

IIT_Delhi

00:38:39

22

Mod-10 Lec-23 Arrangements

IIT_Delhi

01:00:29

23

Mod-10 Lec-24 Zone Theorem and Application

IIT_Delhi

00:52:57

24

Mod-10 Lec-25 Levels

IIT_Delhi

00:59:21

25

Mod-11 Lec-26 Range Searching : Introduction

IIT_Delhi

00:55:37

26

Mod-11 Lec-27 Orthogonal Range searching

IIT_Delhi

00:51:56

27

Mod-11 Lec-28 Priority Search Trees

IIT_Delhi

00:51:35

28

Mod-11 Lec-29 Non - Orthogonal Range Searching

IIT_Delhi

00:55:41

29

Mod-11 Lec-30 Half - Plane Range Query

IIT_Delhi

01:03:55

30

Mod-12 Lec-31 Well Separated Partitioning

IIT_Delhi

00:53:51

31

Mod-12 Lec-32 Quadtrees Epsilon -WSPD

IIT_Delhi

00:49:21

32

Mod-12 Lec-33 Construction of Epsilon - WSPD

IIT_Delhi

00:57:24

33

Mod-12 Lec-34 Epsilon - WSPD to Geometric Spanner

IIT_Delhi

00:59:35

34

Mod-13 Lec-35 Epsilon-Nets & VC Dimension

IIT_Delhi

00:51:44

35

Mod-13 Lec-36 Epsilon-Nets & VC Dimension contd

IIT_Delhi

00:58:05

36

Mod-13 Lec-37 Geometric Set Cover

IIT_Delhi

00:57:13

37

Mod-13 Lec-38 Geometric Set Cover (with Bounded VC Dimension)

IIT_Delhi

00:48:03

38

Mod-14 Lec-39 Shape Representation

IIT_Delhi

01:10:17

39

Mod-14 Lec-40 Shape Comparison

IIT_Delhi

00:48:53

Mod-01 Lec-01 Introduction

0

0

7 Vues

IIT_Delhi
5 subscribers

Dans Développement / Génie logiciel

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

Montre plus

100% online learning from the world's best universities, organisations and Instructors

0 commentaires

Explorez plus

Aider