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
圣彼得堡国立大学課程信息
4,954 次近期查看
可靈活調整截止日期
根據您的日程表重置截止日期。
可分享的證書
完成後獲得證書
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 提供2020年6月23日
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 提供2019年12月30日
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.
常見問題
我什么时候能够访问课程视频和作业？
我购买证书后会得到什么？
有助学金吗？
還有其他問題嗎？請訪問 學生幫助中心。
