- Introduction
- Plane Sweep: Concept
- Data Structures for Plane Sweep Algorithms
- Line Sweep: Missing Parts
- Home
- EIT Digital
- Courses
- Geometric Algorithms
Geometric Algorithms
Gain a comprehensive understanding of the concepts and procedures necessary to construct geometric algorithms from scratch.
Intermediate
Online
3 Weeks
Free
Quick facts
particular | details | |
---|---|---|
Medium of instructions
English
|
Mode of learning
Self study
|
Mode of Delivery
Video and Text Based
|
Course overview
Geometric problems have always been solved via geometric algorithms. Functioning using geometric algorithms requires a thorough understanding of numerous mathematical topics, including algebra, differential geometry, topology, combinatorial optimization, etc. The Geometric Algorithms certification course was developed by EID Digital and is offered through Coursera, which is instructed by Dr. Kevin Buchin, a professor of mathematics and computer science at the Eindhoven University of Technology.
The Geometric Algorithms online course provides the methods and ideas required for the creation and study of geometric algorithms and data structures and covers the algorithmic aspects of computer science, computer graphics, robotics, and virtual reality. The Geometric Algorithms online classes provide 17 hours of in-depth video lectures covering the fundamentals of line sweep algorithms, plane sweep algorithms, and numerous triangulations. By the completion of the course, applicants will be capable of selecting the algorithm or data structure that should be applied to study a given problem and find a solution.
The highlights
- Shareable certificate of completion
- Self-paced course
- 17 hours effort
- 100% online content
- Flexible deadlines
Program offerings
- English video lectures with multiple subtitles
- 100% online content
- Learning resources
- Graded assignments
- Accessible on mobile devices
Course and certificate fees
Type of course
certificate availability
certificate providing authority
certificate fees
What you will learn
After completing the Geometric Algorithms online certification, applicants will develop a better understanding of the principles of geometric algorithms for the design and analysis of efficient algorithms and data structures. Applicants will analyze the characteristics of Voronoi diagrams, plane sweep techniques, and line sweep algorithms. Applicants will learn about Delaunay triangulation, legal triangulations, angle-optimal triangulations, and randomized incremental construction. Applicants will study techniques for orthogonal range searches as well as the competencies needed to work with KD trees and range trees.
Who it is for
The syllabus
Week 1: Plane Sweep Algorithms
Videos
Practice exercises
- Plane Sweep: Concept
- Data Structures for Plane Sweep Algorithms
- Line Sweep: missing parts
- Line Sweep Algorithms
Week 2: Voronoi diagrams and Delaunay triangulations
Videos
- Voronoi Diagrams
- Voronoi Diagrams: Structure
- Complexity of Voronoi Diagrams
- Delaunay Triangulations
- Angle-Optimal Triangulations
- Legal Triangulations
- Randomized Incremental Construction
- Randomized Incremental Construction: Analysis
Practice exercises
- Voronoi
- Triangulations
- Randomized incremental construction
- Voronoi Diagrams and Delaunay triangulations
Week 3: Orthogonal range searching
Videos
- Introduction to Range Searching
- 1D Range Searching
- KD Trees
- Queries in KD-Trees
- Range Trees
- Range Trees: Extensions
Practice exercises
- KD-trees
- Range Trees
- KD and range trees
Instructors
Mr Kevin Buchin
Instructor
EIT Digital
Articles
Popular Articles
Latest Articles
Similar Courses
Calculus 1C Coordinate Systems and Infinite Series
MIT Cambridge via Edx
Preparing for the AP Calculus AB Exam-Part 2 Integ...
Rice University, Houston via Edx
Preparing for the AP Calculus AB Exam Part 1 Deriv...
Rice University, Houston via Edx
Introduction to Calculus
The University of Sydney, Sydney via Coursera
Matrix Methods
University of Minnesota, Minneapolis via Coursera
Linear Algebra Refresher
Udacity
Introduction to Linear Models and Matrix Algebra
Harvard University, Cambridge via Edx
More Fun with Prime Numbers
Kyoto University via Edx
A level Mathematics for Year 12 Course 1 Algebraic...
Imperial College, London via Edx
College Algebra
Doane University, Crete via Edx
Courses of your interest
Advanced Training
Certified Trainer
Making a Cell Therapy Principles and Practice of M...
MIT Cambridge via Edx
Instructional Design for Higher Education
UCI Irvine via Futurelearn
Inclusive Education Understanding Special Educatio...
The Open University, Milton Keynes via Futurelearn
Blended Learning Essentials for Vocational Educati...
The University of Leeds via Futurelearn
Excel for Intermediate Level
Great Learning
Design Thinking for Leading and Learning
MIT Cambridge via Edx
More Courses by EIT Digital
System Validation Automata and Behavioural Equival...
EIT Digital via Coursera
System Validation 2 Model Process Behaviour
EIT Digital via Coursera