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
圣彼得堡国立大学課程信息
11,006 次近期查看
可分享的證書
完成後獲得證書
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 分鐘）
9 個視頻
1.2 Problem statement4分鐘
1.3 Testing point inclusion in a polygon3分鐘
1.4 Algorithmic details3分鐘
1.5 Degenerate cases2分鐘
1.6 Putting everything together3分鐘
1.7 Convex polygons4分鐘
1.8 Testing point inclusion in a convex polygon6分鐘
1.9 Star-shaped polyogns4分鐘
3 個練習
Preliminaries20分鐘
Geometric computing
Polygon hierarchy
完成時間為 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 分鐘）
9 個視頻
2.2 A naïve algorithm5分鐘
2.3 Modified Graham's algorithm10分鐘
2.4 Graham's scan6分鐘
2.5 Jarvis march3分鐘
2.6 Divide and conquer10分鐘
2.7 Incremental algorithms3分鐘
2.8 Quick hull3分鐘
2.9 Chan's algorithm7分鐘
3 個練習
Basic observations
Alternative algorithmic approaches
Refinements
完成時間為 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 分鐘）
6 個視頻
3.2 Plane sweep10分鐘
3.3 Data structures6分鐘
3.4 An algorithm for intersecting line segments11分鐘
3.5 The algorithm complexity9分鐘
3.6 Polygon intersection8分鐘
3 個練習
Intersections and plane sweep
Implementation details
Intersecting polygons
完成時間為 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 分鐘）
7 個視頻
4.2 Traingulation: definition and properties5分鐘
4.3 A naïve algorithm2分鐘
4.4 Graph dual to a triangulation6分鐘
4.5 An ear-cutting algorithm4分鐘
4.6 Monotone polygons4分鐘
4.7 Triangulating a monotone polygon11分鐘
3 個練習
Polygon triangulations: basic properties
Dual graphs
Monotone polygons
審閱
來自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.
常見問題
我什么时候能够访问课程视频和作业？
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
- The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
- The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
我购买证书后会得到什么？
您购买证书后，将有权访问所有课程材料，包括评分作业。完成课程后，您的电子课程证书将添加到您的成就页中，您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容，可以免费旁听课程。
退款政策是如何规定的？
您可在付款后两周内，或者在课程第一个班次开课后（对于已启动的课程）两周内，获得全额退款，以其中较晚者为准。获得课程证书后，您便无法再退款；即使您在两周的退款期内完成了课程，也是如此。请阅读我们完整的退款政策。
有助学金吗？
是的，Coursera 可以向无法承担学费的学生提供助学金。点击左侧‘注册’按钮下的‘助学金’链接即可申请助学金。您可以根据屏幕提示完成申请，申请获批后会收到通知。了解详情。
完成课程后，我会获得大学学分吗？
此课程不提供大学学分，但部分大学可能会选择接受课程证书作为学分。查看您的合作院校，了解详情。Coursera 上的在线学位和 Mastertrack™ 证书提供获得大学学分的机会。
還有其他問題嗎？請訪問 學生幫助中心。
