Alexander S. Kulikov
This course represents an introduction to computational geometry – a branch of algorithm theory that aims at solving problems about geometric objects. Its application areas include computer graphics, computer–aided design and geographic information systems, robotics, and many others. You will learn to apply to this end various algorithmic approaches, and asses their strong and weak points in a particular context, thus gaining an ability to choose the most appropriate method for a concrete problem. We will cover a number of core computational geometry tasks, such as testing point inclusion in a polygon, computing the convex hull of a point set, intersecting line segments, triangulating a polygon, and processing orthogonal range queries. Special attention will be paid to a proper representation of geometric primitives and evaluation of geometric predicates, which are crucial for an efficient implementation of an algorithm. Each module includes a selection of programming tasks that will help you both to strengthen the newly acquired knowledge and improve your competitive coding skills.
Instructor Details
Courses : 8
Specification: Computational Geometry
|
2 reviews for Computational Geometry
Add a review
| Price | Free |
|---|---|
| Provider | |
| Duration | 23 hours |
| Year | 2019 |
| Level | Intermediate |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
Stanislav Z –
Great opportunity to learn the algorithms. Challenging at times trying to figure out where your code went wrong, but you eventually get through it. Assignments can take a bit of time.
Samrat S –
Extremely bad teaching style, Algorithms can not be taught like this through static Power points. Its extremely important to do white boarding with thorough dry run of algorithms with examples.. Very disappointed with this course, I have completed almost 20 courses on coursera but unfortunately this is the first course where i have to give up.