Euclidean Shortest Paths: Exact or Approximate Algorithms

ISBN-13: 9781447122555 / Angielski / Twarda / 2011 / 378 str.

Fajie Li; Reinhard Klette

Opis

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 chapterPresents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithmsDiscusses algorithms for calculating exact or approximate ESPs in the planeExamines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curvesDescribes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problemsIncludes lists of symbols and abbreviations, in addition to other appendicesThis 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.

Recenzje

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)

Spis treści

Part I: Discrete or Continuous Shortest Paths

Euclidean Shortest Paths

Deltas and Epsilons

Rubberband Algorithms

Part II: Paths in the Plane

Convex Hulls in the Plane

Partitioning a Polygon or the Plane

Approximate ESP Algorithms

Part III: Paths in Three-Dimensional Space

Paths on Surfaces

Paths in Simple Polyhedrons

Paths in Cube Curves

Part IV: Art Galleries

Touring Polygons

Watchman Route

Safari and Zookeeper Problems