LAP Lambert Academic Publishing
An Efficient Algorithm for Shortest Path Tree in Dynamic Graph
$44.21
Springer
Euclidean Shortest Paths: Exact or Approximate Algorithms
Product Code:
9781447122555
ISBN13:
9781447122555
Condition:
New
$190.78
Euclidean Shortest Paths: Exact or Approximate Algorithms
$190.78
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.
| Author: Fajie Li |
| Publisher: Springer |
| Publication Date: Nov 04, 2011 |
| Number of Pages: 378 pages |
| Binding: Hardback or Cased Book |
| ISBN-10: 1447122550 |
| ISBN-13: 9781447122555 |
Related Products
