Home » Course Layouts » Free Course Layout Udemy
Computational Geometry. Instructor: Prof. Pankaj Aggarwal, Department of Computer Science and Engineering, IIT Delhi.
0
1
English
English [CC]
- Learn basic syntax that can apply to any language.
- Learn what is a programming language and the basic concepts for beginners.
- Understand what is Javascript in it's truest form.
- Know the basic syntax of Javascript.
- Know some hidden quirks in Javascript.
Description
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 content
-
- 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 11 – Insertion of Half Planes and Duality Unlimited
- Lecture 12 – Insertion of Half Planes and Duality (cont.) Unlimited
- Lecture 14 – Planar Point Location Unlimited
- Lecture 15 – Point Location and Triangulation (cont.) Unlimited
- Lecture 16 – Triangulation of Arbitrary Polygon 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 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 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
Instructor
