HAPPY HOLIDAYS: Get a special discount on Apress Access! Subscribe today >>

Euclidean Shortest Paths

Exact or Approximate Algorithms

Authors: Fajie, Li, Klette, Reinhard

  • 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
see more benefits

Buy this book

eBook $119.00
price for USA
  • ISBN 978-1-4471-2256-2
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $159.00
price for USA
  • ISBN 978-1-4471-2255-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $159.00
price for USA
  • ISBN 978-1-4471-6064-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2- or 3-dimensional space? Variants of this industrially-significant computational geometry problem also require the path to pass through specified areas and avoid defined obstacles.

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. Suitable for a second- or third-year university algorithms course, the text enables readers to understand not only the algorithms and their pseudocodes, but also the correctness proofs, the analysis of time complexities, and other related topics.

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

This hands-on guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortest-path problems in practical applications will also find the book a useful resource.

Dr. Fajie Li is at Huaqiao University, Xiamen, Fujian, China. Prof. Dr. Reinhard Klette is at the Tamaki Innovation Campus of The University of Auckland.

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)


Table of contents (12 chapters)

Buy this book

eBook $119.00
price for USA
  • ISBN 978-1-4471-2256-2
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $159.00
price for USA
  • ISBN 978-1-4471-2255-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $159.00
price for USA
  • ISBN 978-1-4471-6064-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Bibliographic Information

Bibliographic Information
Book Title
Euclidean Shortest Paths
Book Subtitle
Exact or Approximate Algorithms
Authors
Copyright
2011
Publisher
Springer-Verlag London
Copyright Holder
Springer-Verlag London Limited
eBook ISBN
978-1-4471-2256-2
DOI
10.1007/978-1-4471-2256-2
Hardcover ISBN
978-1-4471-2255-5
Softcover ISBN
978-1-4471-6064-9
Edition Number
1
Number of Pages
XVIII, 378
Topics