參考書目
合格證明
Contents
ABSTRACT(IN CHINESE)
ABSTRACT(IN ENGLISH)
ACKNOWLEDGEMENT
List of Figures
1 Introduction
1.1 the Parallel Computation Model
1.2 Previous Work for Polygon Visibility Problems
1.3 The Dissertation Outline
2 Shortest Path Networks on Weighted Visibility Graphs
2.1 Introduction
2.2 Preliminary
2.3 Shortest Path Networks
2.4 Conclusion
3 Parallel Algorithms for Computing the Closest Visible Vertex Pair between Two Polygons
3.1 Introduction
3.2 Parallel Computing of a Closest Visible Vertex Pair when Hull(P) and Hull(Q) are Linearly separable
3.3 Parallel Computing of a Closest Visible Vertex Pair where Hull(P) and Hull(Q) Intersect
3.4 an Improved Version of algorithm B
3.5 Parallel Finding A Closest Visible Vertex Pair Where Hull(P) Con tains Hull(Q)
3.6 Conclusion
4 Optimal Parallel Algorithms for query Problems Related to the Weak Visibility of Polygons
4.1 Introduction
4.2 Preliminaries
4.3 Parallel Algorithms for Testing Weak Visibility from a chord
4.4 Parallel Algorithms for Testing Weak Visibility from a Segment
4.5 conclusion
5 Conclusions and Further Studies
5.1 Shortest Path Networks on Weighted Visibility Graphs
5.2 The Closest Visible Vertex Pair between Two Polygons
5.3 weak Visibility Problems of Polygons
Vita