Euclidean Shortest Paths: Exact or Approximate Algorithms
暫譯: 歐幾里得最短路徑:精確或近似演算法
Fajie Li, Reinhard Klette
- 出版商: Springer
- 出版日期: 2011-11-04
- 售價: $7,100
- 貴賓價: 9.5 折 $6,745
- 語言: 英文
- 頁數: 378
- 裝訂: Hardcover
- ISBN: 1447122550
- ISBN-13: 9781447122555
-
相關分類:
Algorithms-data-structures
海外代購書籍(需單獨結帳)
相關主題
商品描述
This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs in the plane; examines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curves; describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems; includes lists of symbols and abbreviations, in addition to other appendices.
商品描述(中文翻譯)
這本獨特的文本/參考書回顧了用於精確或近似解決最短路徑問題的演算法,特別關注一類稱為橡皮筋演算法的演算法。書中深入討論每個概念和演算法,並為許多給定的陳述提供數學證明。主題和特點包括:在每章結尾提供理論和程式設計練習;對歐幾里得幾何中的最短路徑進行徹底介紹,以及稱為橡皮筋演算法的演算法類別;討論計算平面上精確或近似最短路徑(Exact Shortest Paths, ESP)的演算法;檢視三維表面、簡單多面體和立方曲線上的最短路徑;描述橡皮筋演算法在解決藝術畫廊問題中的應用,包括狩獵、動物園管理員、守衛和巡迴多邊形路徑問題;此外,還包括符號和縮寫的列表,以及其他附錄。