Euclidean Shortest Paths: Exact or Approximate Algorithms

Li, Fajie; Klette, Reinhard

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.

Details

Published by: Springer

Publication Date: 2014-01-25

Format: Paperback

ISBN-13: 9781447160649

DOI: 10.1007/978-1-4471-2256-2

Dimensions: 235cm x155cm

Pages: 378