株式会社極東書店トップ ＞ 商品一覧 ＞ Euclidean Shortest Paths: Exact or Approximate Algorithms. 2011 ed.
商品詳細
Euclidean Shortest Paths: Exact or Approximate Algorithms. 2011 ed.
・ISBN 978-1-4471-6064-9 paper EUR 159.99
￥42,764.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Li, Fajie / Klette, Reinhard, |
|---|---|
| 出版社 | (Springer London Ltd, UK) |
| 出版年月 | 2014 |
| ページ数 | 378 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A05-46475＞ |
解説
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.