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.
提供方
Computational Geometry
圣彼得堡国立大学课程信息
6,133 次近期查看
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
中级
Basic knowledge of at least one programming language (loops, recursion, input/output). Basic math: proof by induction, proof by contradiction.
完成时间大约为19 小时
英语（English）
字幕：英语（English）
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
中级
Basic knowledge of at least one programming language (loops, recursion, input/output). Basic math: proof by induction, proof by contradiction.
完成时间大约为19 小时
英语（English）
字幕：英语（English）
提供方
圣彼得堡国立大学
Санкт-Петербургский государственный университет (СПбГУ) — старейший вуз России, основанный в 1724 году. Университет сегодня — научный, образовательный и культурный центр мирового значения, неизменно входящий во все международные рейтинги вузов. В номинации взаимодействие с работодателями QS Graduate Employability 2018 СПбГУ занимает 20 место среди 400 ведущих вузов мира и является лучшим в России.
授课大纲 - 您将从这门课程中学到什么
完成时间为 4 小时
Point inclusion in a polygon
How can it be determined whether you have selected a particular region on an interactive map? This problem is an excellent starting point to get introduced to computational geometry and a variety of its applications!
完成时间为 4 小时
9 个视频 （总计 41 分钟）
完成时间为 4 小时
Convex hulls
Algorithmic processing of finely shaped objects may be computationally expensive. Can they be reasonably approximated, so as to decrease the handling costs? Convex hulls will come at hand!
完成时间为 4 小时
9 个视频 （总计 54 分钟）
完成时间为 4 小时
Intersections
Geographic information systems typically store a vast amount of data in the form of various maps. How can be those efficiently combined to provide an adequate response to our requests? Get acquainted with the key algorithmic aspects underlying map overlay!
完成时间为 4 小时
6 个视频 （总计 52 分钟）
完成时间为 4 小时
Polygon triangulation
In computer graphics, 3D-scenes are commonly represented by complex polygonal models. Do you wonder how those can be processed efficiently? Triangulation stays behind!
完成时间为 4 小时
7 个视频 （总计 40 分钟）
审阅
来自COMPUTATIONAL GEOMETRY的热门评论
由 NR 提供Jun 23, 2020
Some portions are taught in a great way,some in very average manner.If they can include the running animations for each algorithms,then i would have rated 5-star.Overall,a satisfactory experience.
由 SZ 提供Dec 30, 2019
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.
常见问题
我什么时候能够访问课程视频和作业？
我购买证书后会得到什么？
有助学金吗？
还有其他问题吗？请访问 学生帮助中心。
