Computational Geometry - Study24x7

or

3 followers

Computational Geometry

Validity Unlimited All Level English

0.0 (0)
Free

Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with history stretching back to antiquity.

• Total 14 Modules
• 40 Videos
• Published on 13 June, 2019

Introduction using Basic Visibility Problems

• Lec-01 Introduction

47m
• Lec-02 Visibility Problems

52m

The Maximal Points Problem

• Lec-03 2D Maxima

52m

The Plane Sweep Technique and applications

• Lec-04 Line Sweep Method

1h 60 min
• Lec-05 Segment Intersection Problem

54m
• Lec-06 Line Sweep: Rectangle Union

59m

Convex Hull Different Paradigms and Quickhull

• Lec-07 Convex Hull

52m
• ?Lec-08 Convex Hull Contd

55m
• Lec-09 Quick Hull

54m
• Lec-10 More Convex Hull Algorithms

54m

Dual Transformation and Applicatiopns

• Lec-11 Intersection of Half Planes and Duality

52m
• Lec-12 Intersection of Half Planes and Duality Contd

55m

Lower Bounds on Algebraic tree model

• Lec-13 Lower Bounds

55m

Point Location and Triangulation

• Lec-14 Planar Point Location

58m
• Lec-15 Point Location and Triangulation Contd...

51m
• lec16 Triangulation of Arbitrary Polygon

59m

Voronoi Diagram and Delaunay Triangulation

• Lec-17 Voronoi Diagram : Properties

59m
• ?Lec-18 Voronoi Diagram Construction

59m
• Lec-19 Delaunay Triangulation.

57m

Randomized Incremental Construction and Random Sampling

• Lec-20 Quick sort and Backward Analysis

56m
• Lec-21 Generalized RIC

42m
• Lec-22 RIC Continued

38m

Arrangements and Levels

• Lec-23 Arrangements

1h 60 min
• Lec-24 Zone Theorem and Application

52m
• Lec-25 Levels

59m

Range Searching

• Lec-26 Range Searching : Introduction

55m
• Lec-27 Orthogonal Range searching

51m
• Lec-28 Priority Search Trees

51m
• Lec-29 Non - Orthogonal Range Searching

55m
• Lec-30 Half - Plane Range Query

1h 63 min

Clustering Point Sets using Quadtrees and? Applications

• Lec-31 Well Separated Partitioning

1h 63 min

49m
• Lec-33 Construction of Epsilon - WSPD

57m
• Lec-34 Epsilon - WSPD to Geometric Spanner

59m

Epsilon - Nets VC Dimension and Applications

• Lec-35 Epsilon-Nets & VC Dimension

51m
• Lec-36 Epsilon-Nets & VC Dimension contd

58m
• Lec-37 Geometric Set Cover

57m
• Lec-38 Geometric Set Cover (with Bounded VC Dimension)

48m

Shape Analysis and Shape Comparison

• Lec-39 Shape Representation

48m
• Lec-40 Shape Comparison

48m

4.5 (4)

5.0 (1)

4.0 (1)

0.0 (0)

0.0 (0)

4.5 (2)

5.0 (2)

5.0 (1)

0.0 (0)

5.0 (1)

0.0 (0)

0.0 (0)

0.0 (0)

0.0 (0)

4.5 (12)

4.5 (7)

3.0 (1)

5.0 (1)

5.0 (1)

0.0 (0)

5.0 (1)

0.0 (0)

0.0 (0)

5.0 (1)

5.0 (1)