0

(

ratings

)

1

students

Created by:

Profile Photo

Last updated:

September 25, 2023

Duration:

Unlimited Duration

FREE

This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration

Description

Computational Geometry. Instructor: Prof. Pankaj Aggarwal, Department of Computer Science and Engineering, IIT Delhi.

This course covers lessons in Introduction using Basic Visibility Problems, The Maximal Points Problem, The Plane Sweep Technique and applications, 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, Epsilon-Nets VC Dimension and Applications, Shape Analysis and Shape Comparison. (from nptel.ac.in)

Course Curriculum

    • Lecture 01 – Introduction Unlimited
    • Lecture 02 – Visibility Problems Unlimited
    • Lecture 03 – 2D Maxima Unlimited
    • Lecture 04 – Line Sweep Method Unlimited
    • Lecture 05 – Segment Intersection Problem Unlimited
    • Lecture 06 – Line Sweep: Rectangle Union Unlimited
    • Lecture 07 – Convex Hull Unlimited
    • Lecture 08 – Convex Hull (cont.) Unlimited
    • Lecture 09 – Quick Hull Unlimited
    • Lecture 10 – More Convex Hull Algorithms Unlimited
    • Lecture 11 – Insertion of Half Planes and Duality Unlimited
    • Lecture 12 – Insertion of Half Planes and Duality (cont.) Unlimited
    • Lecture 13 – Lower Bounds Unlimited
    • Lecture 14 – Planar Point Location Unlimited
    • Lecture 15 – Point Location and Triangulation (cont.) Unlimited
    • Lecture 16 – Triangulation of Arbitrary Polygon Unlimited
    • Lecture 17 – Voronoi Diagram: Properties Unlimited
    • Lecture 19 – Delaunay Triangulation Unlimited
    • Lecture 20 – Quick Sort and Backward Analysis Unlimited
    • Lecture 21 – Generalized RIC (Randomized Incremental Construction) Unlimited
    • Lecture 22 – Randomized Incremental Construction (cont.) Unlimited
    • Lecture 23 – Arrangements Unlimited
    • Lecture 24 – Applications of Zone Theorem and Arrangements Unlimited
    • Lecture 25 – Arrangements (cont.) Unlimited
    • Lecture 26 – Range Searching: Introduction Unlimited
    • Lecture 27 – Orthogonal Range Searching Unlimited
    • Lecture 28 – Priority Search Trees Unlimited
    • Lecture 29 – Non-Orthogonal Range Searching Unlimited
    • Lecture 30 – Range Searching: Half Plane Range Counting Unlimited
    • Lecture 31 – Well Separated Partitioning Unlimited
    • Lecture 32 – Quadtrees Epsilon-WSPD (Well Separated Pair Decomposition) Unlimited
    • Lecture 33 – Construction of Epsilon-WSPD Unlimited
    • Lecture 34 – Construction of Epsilon-WSPD (cont.) Unlimited
    • Lecture 35 – Epsilon-Nets and VC Dimension Unlimited
    • Lecture 36 – Epsilon-Nets and VC Dimension (cont.) Unlimited
    • Lecture 37 – Geometric Set Cover Unlimited
    • Lecture 38 – Geometric Set Cover (with Bounded VC Dimension) Unlimited
    • Lecture 39 – Shape Representation Unlimited
    • Lecture 40 – Shape Comparison Unlimited

About the instructor

5 5

Instructor Rating

6

Reviews

4637

Courses

24154

Students

Profile Photo
OpenCoursa
We are an educational and skills marketplace to accommodate the needs of skills enhancement and free equal education across the globe to the millions. We are bringing courses and trainings every single day for our users. We welcome everyone woth all ages, all background to learn. There is so much available to learn and deliver to the people.