About this Course
6,250 recent views

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Basic knowledge of at least one programming language (loops, recursion, input/output). Basic math: proof by induction, proof by contradiction.

Approx. 16 hours to complete

Suggested: 5 weeks of study, 5-8 hours/week...

English

Subtitles: English

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Basic knowledge of at least one programming language (loops, recursion, input/output). Basic math: proof by induction, proof by contradiction.

Approx. 16 hours to complete

Suggested: 5 weeks of study, 5-8 hours/week...

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
4 hours to complete

Point inclusion in a polygon

9 videos (Total 41 min), 4 quizzes
9 videos
1.2 Problem statement4m
1.3 Testing point inclusion in a polygon3m
1.4 Algorithmic details3m
1.5 Degenerate cases2m
1.6 Putting everything together3m
1.7 Convex polygons4m
1.8 Testing point inclusion in a convex polygon6m
1.9 Star-shaped polyogns4m
3 practice exercises
Preliminaries20m
Geometric computing
Polygon hierarchy
Week
2
4 hours to complete

Convex hulls

9 videos (Total 54 min), 4 quizzes
9 videos
2.2 A naïve algorithm5m
2.3 Modified Graham's algorithm10m
2.4 Graham's scan6m
2.5 Jarvis march3m
2.6 Divide and conquer10m
2.7 Incremental algorithms3m
2.8 Quick hull3m
2.9 Chan's algorithm7m
3 practice exercises
Basic observations
Alternative algorithmic approaches
Refinements
Week
3
4 hours to complete

Intersections

6 videos (Total 52 min), 4 quizzes
6 videos
3.2 Plane sweep10m
3.3 Data structures6m
3.4 An algorithm for intersecting line segments11m
3.5 The algorithm complexity9m
3.6 Polygon intersection8m
3 practice exercises
Intersections and plane sweep
Implementation details
Intersecting polygons
Week
4
4 hours to complete

Polygon triangulation

7 videos (Total 40 min), 4 quizzes
7 videos
4.2 Traingulation: definition and properties5m
4.3 A naïve algorithm2m
4.4 Graph dual to a triangulation6m
4.5 An ear-cutting algorithm4m
4.6 Monotone polygons4m
4.7 Triangulating a monotone polygon11m
3 practice exercises
Polygon triangulations: basic properties
Dual graphs
Monotone polygons

Instructors

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Aliaksei Tolstsikau

Senior lecturer
Faculty of applied mathematics and computer science, Belarusian State University Academic programs coordinator, Yandex, Judge of Belarusian olympiad in Informatics. Judge of Western subregional contest of Northern Eurasia. ICPC World finalist (2010), Topcoder collegiate challenge finalist (2007), Google code jam finalist (2008).
Avatar

Kira Vyatkina

Leading Researcher
Center for Algorithmic Biotechnology, Institute of Translational Biomedicine

About Saint Petersburg State University

Санкт-Петербургский государственный университет (СПбГУ) — старейший вуз России, основанный в 1724 году. Университет сегодня — научный, образовательный и культурный центр мирового значения, неизменно входящий во все международные рейтинги вузов. В номинации взаимодействие с работодателями QS Graduate Employability 2018 СПбГУ занимает 20 место среди 400 ведущих вузов мира и является лучшим в России. В настоящее время СПбГУ реализует 418 образовательных программ, включающих самые современные направления подготовки и специальности. Сертификат об успешном окончании представленных онлайн-курсов дает 5 дополнительных баллов при поступлении на программы магистратуры и аспирантуры СПбГУ. St Petersburg University is the oldest university in Russia, founded in 1724. The University today is a world-class research, educational and cultural centre which is always included in all international rankings of world universities. St Petersburg University was ranked 20th in QS Graduate Employability Ranking 2018 among 400 leading universities in the world and is the best in Russia. At present, St Petersburg University offers 418 academic programmes, including the most advanced areas and fields of study. The certificate of successful completion of offered online courses gives five additional points when applying for master’s and doctoral programmes at St Petersburg University....

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

More questions? Visit the Learner Help Center.