Overview
- 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 of each chapter
- Discusses each concept and algorithm in depth, including mathematical proofs for many of the given statements
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (12 chapters)
-
Front Matter
-
Discrete or Continuous Shortest Paths
-
Front Matter
-
-
Paths in the Plane
-
Front Matter
-
-
Paths in 3-Dimensional Space
-
Front Matter
-
-
Art Galleries
-
Front Matter
-
-
Back Matter
Reviews
From the book reviews:
“This book presents selected algorithms for the exact or approximate solution of several variants of the Euclidean shortest path problem (ESP). … The book has been successful in addressing the Euclidean Shortest Path problems by presenting exact and approximate algorithms in the light of rubberband algorithms, and will be immensely useful to students and researchers in the area.” (Arindam Biswas, IAPR Newsletter, Vol. 37 (1), January, 2015)
“Li (Huaqiao Univ., China) and Klette (Univ. of Auckland, New Zealand) have written an interesting and very reader-friendly book on algorithms that find a shortest path between two vertices of a graph. … this is the first book-length treatment of the topic. The entire text is accessible to advanced undergraduates. … Summing Up: Highly recommended. Upper-division undergraduates, graduate students, and researchers/faculty.” (M. Bona, Choice, Vol. 49 (9), May, 2012)
Authors and Affiliations
Bibliographic Information
Book Title: Euclidean Shortest Paths
Book Subtitle: Exact or Approximate Algorithms
Authors: Fajie Li, Reinhard Klette
DOI: https://doi.org/10.1007/978-1-4471-2256-2
Publisher: Springer London
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag London Limited 2011
Hardcover ISBN: 978-1-4471-2255-5Published: 04 November 2011
Softcover ISBN: 978-1-4471-6064-9Published: 25 January 2014
eBook ISBN: 978-1-4471-2256-2Published: 03 November 2011
Edition Number: 1
Number of Pages: XVIII, 378
Topics: Algorithm Analysis and Problem Complexity, Numeric Computing, Pattern Recognition, Discrete Mathematics in Computer Science, Math Applications in Computer Science, Computer-Aided Engineering (CAD, CAE) and Design