Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
The branch of algorithm theory that aims to solve problems related to geometric objects is known as Computational Geometry. Its application areas include computer robotics, graphics, computer-aided design, geographic information systems, and many others. In this course, candidates will learn to apply computational geometry to several algorithmic approaches and assess their strengths and weaknesses in a context. That will allow them to select the most appropriate method to approach a specific problem.
The Computational Geometry certification course covers various core computational tasks, such as computing the convex hull in a point set, testing point inclusion in a polygon, triangulating a polygon, intersecting line segments, and processing orthogonal range queries. It pays attention to the evaluation of geometric predicates and proper representation of geometric primitives, which are critical for the efficient implementation of an algorithm.
Learners can complete the Computational Geometry course in approximately nineteen hours. Upon completion, they can purchase a shareable certificate of completion from Coursera.
The Highlights
Intermediate level course
Self-paced learning
100% Online
Deadlines are flexible
Subtitles in English
Financial assistance available
Complete in 19 hours (approx.)
Shareable certificate upon completion
Programme Offerings
- 100% online course
- pre recorded video lectures
- intermediate level course
- video transcript
- Practice Exercises
- peer feedback
- Flexible Deadlines
- Shareable Certificate
- financial aid
Courses and Certificate Fees
| Fees Informations | Certificate Availability | Certificate Providing Authority |
|---|---|---|
| INR 2152 | yes | Coursera |
Click on the ‘Enroll for Free’ button to access the Computational Geometry online course completely free of cost. But the completion certificate and graded items are only available after you purchase the certification experience.
Eligibility Criteria
Prerequisites necessary to join the Computational Geometry certification course include a basic understanding of at least one programming language (recursion, loops, input/output). Also, candidates must have a basic knowledge of mathematical concepts to make the most of the certification course.
Moreover, to complete the Computational Geometry online course, candidates need to watch video lectures and finish the practice exercises after each module. They also need to submit the assignments on time. Finally, upon satisfactory course completion, they will earn a certificate from Coursera.
What you will learn
Upon finishing the Computational Geometry online course successfully, candidates should have acquired the knowledge and skills necessary for:
Processing orthogonal range queries.
Testing point inclusion in a polygon
Intersecting line segments
Triangulating a polygon
Applying various algorithmic approaches
Evaluating geometric predicates
Who it is for
Admission Details
Interested candidates can join the Coursera Computational Geometry online course by following these steps:
- Visit the Course page.
- Type “Computational Geometry” in the search bar and open the course page.
- On the course page, locate the “Join for Free” button present at the top right corner and click on it.
- Candidates who have an existing account on Coursera can enrol for the course by logging in. Others can log in using their Google, Facebook, or Apple account. They can also create a new account on Coursera.
Application Details
Candidates are not required to fill out a separate application form to apply to the Computational Geometry course. They can access the learning material free of cost, just by signing up with Coursera via their Google, Facebook, or Apple account.
The Syllabus
Introduction
Problem statement
Testing point inclusion in a polygon
Algorithmic details
Degenerate cases
Putting everything together
Convex polygons
Testing point inclusion in a convex polygon
Star-shaped polygons
The convex hull in a planar point set
A naïve algorithm
Modified Graham's algorithm
Graham's scan
Jarvis march
Divide and conquer
Incremental algorithms
Quick hull
Chan's algorithm
Line segment intersections
Plane sweep
Data structures
An algorithm for intersecting line segments
The algorithm complexity
Polygon intersection
A diagonal
Triangulation: definition and properties
A naïve algorithm
Graph dual to a triangulation
An ear-cutting algorithm
Monotone polygons
Triangulating a monotone polygon
Motivation and problem statement
1-dimensional range search
Querying a 1-dimensional range tree
Range trees
Constructing and querying range trees
Fractional cascading
Layered-range trees
Priority search trees
Querying a priority search tree
Instructors
SPbU Frequently Asked Questions (FAQ's)
Prerequisites for the Computational Geometry course include basic knowledge of input/output, loops, recursion, etc. in at least one programming language. Basic knowledge of mathematical concepts such as proof by contradiction and proof by induction is also required.
Candidates can complete the Computational Geometry course in approximately 19 hours.
Saint Petersburg State University is offering the Computational Geometry online course.
Practice assignments are available after completing each module of the Computational Geometry course.
The completion certificate is paid, so candidates must request it. Certificate can be requested before, during, or after completing the course.
Yes, the certification course is available in a self-paced mode with flexible deadlines, so you can complete the course lessons at your convenience.
The Computational Geometry course does not offer any university credit, but some universities may award credits for course completion certificates. Check with your institution/college/university for more information.