Euclidean Shortest Paths: Exact or Approximate Algorithms and over 2 million other books are available for Amazon Kindle . Learn more
£103.50
FREE Delivery in the UK.
In stock.
Dispatched from and sold by Amazon.
Gift-wrap available.
Quantity:1
Euclidean Shortest Paths:... has been added to your Basket
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 3 images

Euclidean Shortest Paths: Exact or Approximate Algorithms Paperback – 25 Jan 2014


See all 3 formats and editions Hide other formats and editions
Amazon Price New from Used from
Kindle Edition
"Please retry"
Paperback
"Please retry"
£103.50
£76.38 £97.16
£103.50 FREE Delivery in the UK. In stock. Dispatched from and sold by Amazon. Gift-wrap available.



Product details


More About the Authors

Discover books, learn about writers, and more.

Product Description

Review

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)

From the Back Cover

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.


Inside This Book

(Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Customer Reviews

There are no customer reviews yet.
5 star
4 star
3 star
2 star
1 star


Feedback