GRA110
-
00:00
1.
Geometric Reasoning and Applications: Visibility Graphs
-
00:08
2.
Motivation
-
03:09
3.
Problem Assumptions
-
05:47
4.
Shortest Path with Roadmaps
-
08:11
5.
Characteristics of a Shortest Path
-
10:11
6.
Visibility Graph Method
-
13:24
7.
Shortest Path Algorithm
-
16:10
8.
Computing the Visibility Graph
-
17:56
9.
Rotational Plane Sweep
-
23:22
10.
Maintaining Status
-
31:00
11.
Visibility Graph Method
-
33:10
12.
Visibility Graph Method
-
34:17
13.
Shortest Path Algorithm
-
35:03
14.
Computing the Visibility Graph
-
35:37
15.
Rotational Plane Sweep
-
38:56
16.
Maintaining Status
-
41:07
17.
VisibleVertices(p, S) Algorithm
-
44:19
18.
Visible Routine
-
47:03
19.
Maintaining Status
-
47:18
20.
Visible Routine
-
51:46
21.
Finding Visible Vertices
-
55:20
22.
Conclusions
-
00:00
1.
Geometric Reasoning and Applications: Visibility Graphs
-
00:08
2.
Motivation
-
03:09
3.
Problem Assumptions
-
05:47
4.
Shortest Path with Roadmaps
-
08:11
5.
Characteristics of a Shortest Path
-
10:11
6.
Visibility Graph Method
-
13:24
7.
Shortest Path Algorithm
-
16:10
8.
Computing the Visibility Graph
-
17:56
9.
Rotational Plane Sweep
-
23:22
10.
Maintaining Status
-
31:00
11.
Visibility Graph Method
-
33:10
12.
Visibility Graph Method
-
34:17
13.
Shortest Path Algorithm
-
35:03
14.
Computing the Visibility Graph
-
35:37
15.
Rotational Plane Sweep
-
38:56
16.
Maintaining Status
-
41:07
17.
VisibleVertices(p, S) Algorithm
-
44:19
18.
Visible Routine
-
47:03
19.
Maintaining Status
-
47:18
20.
Visible Routine
-
51:46
21.
Finding Visible Vertices
-
55:20
22.
Conclusions
- 位置
-
- 資料夾名稱
- 資科系 李蔡彥老師
- 上傳者
- 李蔡彥
- 單位
- nccu
- 建立
- 2020-06-14 20:27:53
- 最近修訂
- 2020-06-14 21:31:34
- 長度
- 1:05:11