| Euclidean Shortest Paths: Exact or Approximate Algorithms 2011 Edition Contributor(s): Li, Fajie (Author), Klette, Reinhard (Author) |
|
 |
ISBN: 1447160649 ISBN-13: 9781447160649 Publisher: Springer OUR PRICE: $170.99 Product Type: Paperback - Other Formats Published: January 2014 |
| Additional Information |
| BISAC Categories: - Computers | Programming - Algorithms - Computers | Cad-cam - Computers | Computer Vision & Pattern Recognition |
| Dewey: 511.5 |
| Physical Information: 0.81" H x 6.14" W x 9.21" (1.22 lbs) 378 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |