| FindBook |
有 1 項符合
幾何路徑--理論與實踐(英文)的圖書 |
 |
幾何路徑--理論與實踐(英文) 作者：（美）賽達·納萊雅那帕 出版社：哈爾濱工業大學出版社 出版日期：2021-08-01 語言：簡體中文 規格：平裝 / 132頁 / 13 x 19 x 1 cm / 普通級/ 1-1 |
博客來| 圖書館借閱 |
| 國家圖書館 | 全國圖書書目資訊網 | 國立公共資訊圖書館 | 電子書服務平台 | MetaCat 跨館整合查詢 |
| 臺北市立圖書館 | 新北市立圖書館 | 基隆市公共圖書館 | 桃園市立圖書館 | 新竹縣公共圖書館 |
| 苗栗縣立圖書館 | 臺中市立圖書館 | 彰化縣公共圖書館 | 南投縣文化局 | 雲林縣公共圖書館 |
| 嘉義縣圖書館 | 臺南市立圖書館 | 高雄市立圖書館 | 屏東縣公共圖書館 | 宜蘭縣公共圖書館 |
| 花蓮縣文化局 | 臺東縣文化處 |
|
|
圖書介紹 - 資料來源：博客來 評分：
圖書名稱：幾何路徑--理論與實踐(英文)
內容簡介
幾何路徑是解決幾何集合中出現的路徑問題的很好解決方案。本書主要介紹了幾何路徑的相關知識，提供了一個洞察問題的很好路徑幾何圖形。本書共分六章，包括引言、機組盤蓋、最小轉發集、兩跳可實現性、簡單加權區域問題的準確解和一般加權區域問題。
目錄
1 Introduction
1.1 Geometric graphs
1.2 Unit disk covering problem
1.3 Minimum forwarding set problem
1.4 Weighted region problem
1.5 Book outline
1.6 Notation
1.6.1 Abbreviations
2 Unit Disk Covering
2.1 Improved approximation factor
2.2 Generalizing the method
2.3 Thin disk coverings
3 Minimum Forwarding Set
3.1 Preliminaries
3.1.1 Notation
3.2 Two-hop neighbors
3.2.1 Elimination algorithm
3.2.2 Exact algorithm
3.2.3 Elimination process and ε-net
3.3 Experimental results
3.4 One-hop neighbors
3.4.1 Approximation factor
3.4.2 Fan
3.4.3 Distance of one-hop neighbors
4 Two-hop Realizability
4.1 Two-hop realizable
4.2 Preliminaries
4.2.1 Notation
4.3 Two-hop realizable graphs
4.3.1 Graphs with degree restricted to one
4.3.2 Graphs with degree restricted to at most two
4.4 Conclusions
5 Exact Solutions for Simple Weighted Region Problems
5.1 Preliminaries
5.2 Paths through strips
5.2.1 Multiple strips of equal weights
5.2.2 Multiple strips of different weights
5.3 Paths through a triangle
5.4 Convex polygon
5.4.1 Paths through regular n-gons
5.5 Future work
6 The General Weighted Region Problem
6.1 Preliminaries
6.2 Raster model
6.2.1 Maximum deviation and elongation errors
6.2.2 An optimal straight raster path
6.2.3 Raster subpath
6.3 Vector model
6.4 Future work
Bibliography
編輯手記
1.1 Geometric graphs
1.2 Unit disk covering problem
1.3 Minimum forwarding set problem
1.4 Weighted region problem
1.5 Book outline
1.6 Notation
1.6.1 Abbreviations
2 Unit Disk Covering
2.1 Improved approximation factor
2.2 Generalizing the method
2.3 Thin disk coverings
3 Minimum Forwarding Set
3.1 Preliminaries
3.1.1 Notation
3.2 Two-hop neighbors
3.2.1 Elimination algorithm
3.2.2 Exact algorithm
3.2.3 Elimination process and ε-net
3.3 Experimental results
3.4 One-hop neighbors
3.4.1 Approximation factor
3.4.2 Fan
3.4.3 Distance of one-hop neighbors
4 Two-hop Realizability
4.1 Two-hop realizable
4.2 Preliminaries
4.2.1 Notation
4.3 Two-hop realizable graphs
4.3.1 Graphs with degree restricted to one
4.3.2 Graphs with degree restricted to at most two
4.4 Conclusions
5 Exact Solutions for Simple Weighted Region Problems
5.1 Preliminaries
5.2 Paths through strips
5.2.1 Multiple strips of equal weights
5.2.2 Multiple strips of different weights
5.3 Paths through a triangle
5.4 Convex polygon
5.4.1 Paths through regular n-gons
5.5 Future work
6 The General Weighted Region Problem
6.1 Preliminaries
6.2 Raster model
6.2.1 Maximum deviation and elongation errors
6.2.2 An optimal straight raster path
6.2.3 Raster subpath
6.3 Vector model
6.4 Future work
Bibliography
編輯手記
|
