GRA110
-
00:00
1.
Geometric Reasoning and Applications:Line Segment Intersection
-
00:37
2.
Line Segment Intersection
-
08:25
3.
Transforming to a Geometric Problem
-
12:32
4.
Problem Analysis
-
19:28
5.
Plane Sweep Algorithm
-
27:56
6.
Plane Sweep Algorithm (Cont.)
-
35:26
7.
Plane Sweep Algorithm (Cont.)
-
36:33
8.
Nasty Cases (Degeneracy)
-
38:48
9.
Plane-Sweep Algorithm (Summary)
-
42:02
10.
Event Types
-
46:25
11.
Data Structure
-
48:51
12.
Implementing Event Queue
-
52:42
13.
Status Structure, T
-
1:08:33
14.
Find Intersection Algorithm
-
1:10:47
15.
Handling Changes in Status
-
1:12:39
16.
Handling Changes in Status
-
1:13:31
17.
HandleEventPoint (p)
-
1:17:43
18.
Handling Changes in Status
-
1:18:05
19.
HandleEventPoint (p)
-
1:19:54
20.
HandleEventPoint (p)
-
1:23:03
21.
FindNewEvent (sl, sr, p)
-
1:25:08
22.
FindNewEvent (sl, sr, p)
-
1:25:27
23.
Find Intersection Algorithm
-
1:26:05
24.
HandleEventPoint (p)
-
1:26:32
25.
HandleEventPoint (p)
-
1:28:27
26.
FindNewEvent (sl, sr, p)
-
1:28:54
27.
Plane Sweep Algorithm: Analysis
-
1:37:15
28.
Doubly-Connected Edge List
-
1:45:08
29.
Computing Overlay of Subdivisions
-
1:50:18
30.
Boolean Operations
-
1:52:51
31.
Boolean Operations
-
00:00
1.
Geometric Reasoning and Applications:Line Segment Intersection
-
00:37
2.
Line Segment Intersection
-
08:25
3.
Transforming to a Geometric Problem
-
12:32
4.
Problem Analysis
-
19:28
5.
Plane Sweep Algorithm
-
27:56
6.
Plane Sweep Algorithm (Cont.)
-
35:26
7.
Plane Sweep Algorithm (Cont.)
-
36:33
8.
Nasty Cases (Degeneracy)
-
38:48
9.
Plane-Sweep Algorithm (Summary)
-
42:02
10.
Event Types
-
46:25
11.
Data Structure
-
48:51
12.
Implementing Event Queue
-
52:42
13.
Status Structure, T
-
1:08:33
14.
Find Intersection Algorithm
-
1:10:47
15.
Handling Changes in Status
-
1:12:39
16.
Handling Changes in Status
-
1:13:31
17.
HandleEventPoint (p)
-
1:17:43
18.
Handling Changes in Status
-
1:18:05
19.
HandleEventPoint (p)
-
1:19:54
20.
HandleEventPoint (p)
-
1:23:03
21.
FindNewEvent (sl, sr, p)
-
1:25:08
22.
FindNewEvent (sl, sr, p)
-
1:25:27
23.
Find Intersection Algorithm
-
1:26:05
24.
HandleEventPoint (p)
-
1:26:32
25.
HandleEventPoint (p)
-
1:28:27
26.
FindNewEvent (sl, sr, p)
-
1:28:54
27.
Plane Sweep Algorithm: Analysis
-
1:37:15
28.
Doubly-Connected Edge List
-
1:45:08
29.
Computing Overlay of Subdivisions
-
1:50:18
30.
Boolean Operations
-
1:52:51
31.
Boolean Operations
- 位置
-
- 資料夾名稱
- 資科系 李蔡彥老師
- 發表人
- 李蔡彥
- 單位
- nccu
- 建立
- 2020-04-15 22:19:40
- 最近修訂
- 2020-04-16 02:23:01
- 長度
- 1:56:38