Efficient algorithms for geometric searching problems 幾何探索問題に対する効率的なアルゴリズムに関する研究
この論文にアクセスする
この論文をさがす
著者
書誌事項
- タイトル
-
Efficient algorithms for geometric searching problems
- タイトル別名
-
幾何探索問題に対する効率的なアルゴリズムに関する研究
- 著者名
-
譚, 学厚, 1962-
- 著者別名
-
タン, ガクコウ
- 学位授与大学
-
名古屋大学
- 取得学位
-
工学博士
- 学位授与番号
-
甲第2536号
- 学位授与年月日
-
1992-01-13
注記・抄録
博士論文
目次
- CONTENTS / p1 (0004.jp2)
- 1 Introduction / p1 (0006.jp2)
- 1.1 Computational geometry / p1 (0006.jp2)
- 1.2 The objective of this thesis / p5 (0010.jp2)
- 1.3 The organization of this thesis / p8 (0013.jp2)
- 1.4 Algorithmic techniques for geometric problems / p9 (0014.jp2)
- 2 Preliminaries / p15 (0020.jp2)
- 2.1 Notation / p15 (0020.jp2)
- 2.2 Models of computation / p17 (0022.jp2)
- 2.3 Time and space complexities / p18 (0023.jp2)
- 2.4 Data structures / p19 (0024.jp2)
- 3 Spatial Subdivision Searching and Its Applications / p27 (0032.jp2)
- 3.1 Introduction / p27 (0032.jp2)
- 3.2 Spatial subdivision searching / p28 (0033.jp2)
- 3.3 Spatial point location using a pair of persistent search trees / p30 (0035.jp2)
- 3.4 Applications / p39 (0044.jp2)
- 3.5 Algorithmic efficiency for convex subdivisions / p43 (0048.jp2)
- 3.6 Summary / p46 (0051.jp2)
- 4 The Acyclicity Theorem for Voronoi Diagrams / p47 (0052.jp2)
- 4.1 Introduction / p47 (0052.jp2)
- 4.2 The acyclicity theorem for Voronoi diagrams and its generalization / p50 (0055.jp2)
- 4.3 The acyclicity theorem for higher-order Voronoi diagrams and power diagrams / p55 (0060.jp2)
- 4.4 Applications to nearest neighbor searching and point-location / p61 (0066.jp2)
- 4.5 Summary / p62 (0067.jp2)
- 5 Geometric Searching with Finitely Oriented Objects / p63 (0068.jp2)
- 5.1 Introduction / p63 (0068.jp2)
- 5.2 Reporting intersections of c-oriented polygons / p64 (0069.jp2)
- 5.3 c-oriented polygonal intersection searching / p75 (0080.jp2)
- 5.4 Translating c-oriented faces in three dimensions / p80 (0085.jp2)
- 5.5 Summary / p96 (0101.jp2)
- 6 Optimum Watchman Routes in Simple Polygons / p99 (0104.jp2)
- 6.1 Introduction / p99 (0104.jp2)
- 6.2 Shortest watchman routes / p100 (0105.jp2)
- 6.3 Incremental construction of shortest watchman routes / p104 (0109.jp2)
- 6.4 Analysis of the algorithm / p118 (0123.jp2)
- 6.5 Summary / p123 (0128.jp2)
- 7 Conclusion / p126 (0131.jp2)
- Acknowledgements / p131 (0136.jp2)
- References / p132 (0137.jp2)