About

The course discusses the basic algorithms of computational geometry.

Syllabus

• Geometric search.
• Construction of convex hulls.
• Defining intersections of objects.
• Voronoi diagrams and Delaunay triangulations.
• Proximity of geometric objects.
• Median axes and skeletons.

Labworks

The course assumes the solution of several laboratory works.

Grading

The assessment is based on the results of laboratory work and an oral exam.

Prerequisites

Machine learning, data structures and algorithms.