TY  - BOOK
AU  - Li,Fajie
AU  - Klette,Reinhard
ED  - SpringerLink (Online service)
TI  - Euclidean Shortest Paths: Exact or Approximate Algorithms 
SN  - 9781447122562
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 2011///
CY  - London
PB  - Springer London, Imprint: Springer
KW  - Computer science
KW  - Computer software
KW  - Electronic data processing
KW  - Computational complexity
KW  - Optical pattern recognition
KW  - Computer aided design
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Numeric Computing
KW  - Pattern Recognition
KW  - Discrete Mathematics in Computer Science
KW  - Math Applications in Computer Science
KW  - Computer-Aided Engineering (CAD, CAE) and Design
N1  - 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
N2  - 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
UR  - http://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-1-4471-2256-2
ER  -