跳到主要內容
支援

計算幾何

註冊功能已經關閉

關於本課程

課程目標

I) Thorough understanding of the geometric properties of the problem

II) Proper application of algorithmic techniques and data structures

授課內容

Introduction

1.Line Segment Intersection
2.Polygon Triangulation
3.Linear Programming
4.Orthogonal Range Searching
5.Point Location
6.Voronoi Diagrams
7.Midterm exam
8.Arrangements
9.Interval & Segment Trees
10.Convex Hulls
11.Delaunay Triangulations
12.Robot motion planning
13.Mesh Generation
14.Simplex Range Searching

評分方式

Written Assignments 50% (5 higher ones out of all assignments, 10% each)
Midterm Exam 20%
Final Exam 20%
Final Presentation 10%
Total 100%

課程人員

Course Staff Image #1

孫敏德 副教授

辦公室時間

Tu 4:00P – 6:00P, Th 6:00P - 7:00P, or by appointment.

參考書目

Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars Computational Geometry: Algorithms and Applications, 3rd Edition. 2008. Springer-Verlag. ISBN-13: 9783540779735