GRA110
-
00:37
1.
Geometric Reasoning and Applications:Line Segment Intersection
-
07:47
2.
Line Segment Intersection
-
04:07
3.
Transforming to a Geometric Problem
-
06:55
4.
Problem Analysis
-
08:27
5.
Plane Sweep Algorithm
-
07:30
6.
Plane Sweep Algorithm (Cont.)
-
01:07
7.
Plane Sweep Algorithm (Cont.)
-
02:14
8.
Nasty Cases (Degeneracy)
-
03:14
9.
Plane-Sweep Algorithm (Summary)
-
04:22
10.
Event Types
-
02:25
11.
Data Structure
-
03:51
12.
Implementing Event Queue
-
15:51
13.
Status Structure, T
-
02:14
14.
Find Intersection Algorithm
-
01:51
15.
Handling Changes in Status
-
00:52
16.
Handling Changes in Status
-
04:11
17.
HandleEventPoint (p)
-
00:22
18.
Handling Changes in Status
-
01:48
19.
HandleEventPoint (p)
-
03:09
20.
HandleEventPoint (p)
-
02:05
21.
FindNewEvent (sl, sr, p)
-
00:18
22.
FindNewEvent (sl, sr, p)
-
00:37
23.
Find Intersection Algorithm
-
00:26
24.
HandleEventPoint (p)
-
01:55
25.
HandleEventPoint (p)
-
00:27
26.
FindNewEvent (sl, sr, p)
-
08:21
27.
Plane Sweep Algorithm: Analysis
-
07:52
28.
Doubly-Connected Edge List
-
05:10
29.
Computing Overlay of Subdivisions
-
02:33
30.
Boolean Operations
-
03:46
31.
Boolean Operations
-
00:37
1.
Geometric Reasoning and Applications:Line Segment Intersection
-
07:47
2.
Line Segment Intersection
-
04:07
3.
Transforming to a Geometric Problem
-
06:55
4.
Problem Analysis
-
08:27
5.
Plane Sweep Algorithm
-
07:30
6.
Plane Sweep Algorithm (Cont.)
-
01:07
7.
Plane Sweep Algorithm (Cont.)
-
02:14
8.
Nasty Cases (Degeneracy)
-
03:14
9.
Plane-Sweep Algorithm (Summary)
-
04:22
10.
Event Types
-
02:25
11.
Data Structure
-
03:51
12.
Implementing Event Queue
-
15:51
13.
Status Structure, T
-
02:14
14.
Find Intersection Algorithm
-
01:51
15.
Handling Changes in Status
-
00:52
16.
Handling Changes in Status
-
04:11
17.
HandleEventPoint (p)
-
00:22
18.
Handling Changes in Status
-
01:48
19.
HandleEventPoint (p)
-
03:09
20.
HandleEventPoint (p)
-
02:05
21.
FindNewEvent (sl, sr, p)
-
00:18
22.
FindNewEvent (sl, sr, p)
-
00:37
23.
Find Intersection Algorithm
-
00:26
24.
HandleEventPoint (p)
-
01:55
25.
HandleEventPoint (p)
-
00:27
26.
FindNewEvent (sl, sr, p)
-
08:21
27.
Plane Sweep Algorithm: Analysis
-
07:52
28.
Doubly-Connected Edge List
-
05:10
29.
Computing Overlay of Subdivisions
-
02:33
30.
Boolean Operations
-
03:46
31.
Boolean Operations
- Location
-
- Folder name
- 資科系 李蔡彥老師
- Author
- 李蔡彥
- Branch
- nccu
- Created
- 2020-04-15 22:19:40
- Last Updated
- 2020-04-16 02:23:01
- Browse
- 547
- Duration
- 1:56:38