GRA110
-
00:08
1.
Geometric Reasoning and Applications: Visibility Graphs
-
03:00
2.
Motivation
-
02:38
3.
Problem Assumptions
-
02:24
4.
Shortest Path with Roadmaps
-
01:59
5.
Characteristics of a Shortest Path
-
03:13
6.
Visibility Graph Method
-
02:45
7.
Shortest Path Algorithm
-
01:46
8.
Computing the Visibility Graph
-
05:25
9.
Rotational Plane Sweep
-
07:38
10.
Maintaining Status
-
02:09
11.
Visibility Graph Method
-
01:07
12.
Visibility Graph Method
-
00:46
13.
Shortest Path Algorithm
-
00:34
14.
Computing the Visibility Graph
-
03:18
15.
Rotational Plane Sweep
-
02:11
16.
Maintaining Status
-
03:11
17.
VisibleVertices(p, S) Algorithm
-
02:44
18.
Visible Routine
-
00:14
19.
Maintaining Status
-
04:27
20.
Visible Routine
-
03:34
21.
Finding Visible Vertices
-
09:50
22.
Conclusions
-
00:08
1.
Geometric Reasoning and Applications: Visibility Graphs
-
03:00
2.
Motivation
-
02:38
3.
Problem Assumptions
-
02:24
4.
Shortest Path with Roadmaps
-
01:59
5.
Characteristics of a Shortest Path
-
03:13
6.
Visibility Graph Method
-
02:45
7.
Shortest Path Algorithm
-
01:46
8.
Computing the Visibility Graph
-
05:25
9.
Rotational Plane Sweep
-
07:38
10.
Maintaining Status
-
02:09
11.
Visibility Graph Method
-
01:07
12.
Visibility Graph Method
-
00:46
13.
Shortest Path Algorithm
-
00:34
14.
Computing the Visibility Graph
-
03:18
15.
Rotational Plane Sweep
-
02:11
16.
Maintaining Status
-
03:11
17.
VisibleVertices(p, S) Algorithm
-
02:44
18.
Visible Routine
-
00:14
19.
Maintaining Status
-
04:27
20.
Visible Routine
-
03:34
21.
Finding Visible Vertices
-
09:50
22.
Conclusions
- Location
-
- Folder name
- 資科系 李蔡彥老師
- Author
- 李蔡彥
- Branch
- nccu
- Created
- 2020-06-14 20:27:53
- Last Updated
- 2020-06-14 21:31:34
- Browse
- 604
- Duration
- 1:05:11