課程大綱 Syllabus |
學生學習目標 Learning Objectives |
單元學習活動 Learning Activities |
學習成效評量 Evaluation |
備註 Notes |
序 No. | 單元主題 Unit topic |
內容綱要 Content summary |
1 | Week1: 中秋節放假 |
no class |
n/a |
|
|
|
2 | Week 2 |
What is Computational Geometry |
what the course is about |
|
|
|
3 | Week 3 |
Convex Hull |
algorithms, complexity |
|
|
|
4 | Week 4 |
Bounding Volume |
AABB, OBB collision |
|
|
|
5 | Week 5: 國慶連休 |
no class |
n/a |
|
|
|
6 | Week 6 |
Orthogonal range search |
kd-tree |
|
|
|
7 | Week 7 |
Nearest neighbor search, closest pair search |
kd-tree application |
|
|
|
8 | Week 8 |
Polygon triangulation |
ear cutting algorithms ... |
|
|
|
9 | Week 9: midterm week |
no class |
n/a |
|
|
|
10 | Week 10 |
Halfedge data structure |
data structure |
|
|
|
11 | Week 11 |
Point location problem |
algorithm |
|
|
|
12 | Week 12 |
Voronoi diagram |
defintion |
|
|
|
13 | Week 13 |
Voronoi diagram, Delaunay triangulation |
algorithm |
|
|
|
14 | Week 14 |
Delaunay triangulation (cont) |
many other algorithms |
|
|
|
15 | Week 15 |
Robot motion planning |
c-space |
|
|
|
16 | Week 16 |
GJK algorithm |
distance between convex objects |
|
|
|
17 | Week 17 |
Final exam |
course review |
|
|
|
18 | Week 18: final week |
no class |
n/a |
|
|
|