| 書目名稱 | Euclidean Shortest Paths | | 副標題 | Exact or Approximate | | 編輯 | Fajie Li,Reinhard Klette | | 視頻video | http://file.papertrans.cn/317/316426/316426.mp4 | | 概述 | Reviews algorithms for the exact or approximate solution of Euclidean shortest-path problems, with a specific focus on rubberband algorithms.Provides theoretical and programming exercises at the end o | | 圖書封面 |  | | 描述 | 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. | | 出版日期 | Book 2011 | | 關(guān)鍵詞 | Art Gallery Problems; Computational Geometry; Cube Curves; Euclidean Shortest Path; Parts Cutting Proble | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4471-2256-2 | | isbn_softcover | 978-1-4471-6064-9 | | isbn_ebook | 978-1-4471-2256-2 | | copyright | Springer-Verlag London Limited 2011 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 01:45
發(fā)表于 2025-3-21 20:07:10
