03700nmm a2200385 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100001400139245011700153250001700270260004000287300003400327505047400361653003500835653002300870653004500893653005300938653001500991653005001006653003101056653002301087653002501110653003401135653003201169700003101201041001901232989003601251028003001287856007201317082001001389520191501399EB000363057EBX0100000000000000021610900000000000000.0cr|||||||||||||||||||||130626 ||| eng a97814471225621 aLi, Fajie00aEuclidean Shortest PathshElektronische RessourcebExact or Approximate Algorithmscby Fajie Li, Reinhard Klette a1st ed. 2011 aLondonbSpringer Londonc2011, 2011 aXVIII, 378 pbonline resource0 aPart 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 aComputer science / Mathematics aNumerical Analysis aDiscrete Mathematics in Computer Science aComputer-Aided Engineering (CAD, CAE) and Design aAlgorithms aMathematical Applications in Computer Science aComputer-aided engineering aNumerical analysis aDiscrete mathematics aAutomated Pattern Recognition aPattern recognition systems1 aKlette, Reinharde[author]07aeng2ISO 639-2 bSpringeraSpringer eBooks 2005-50a10.1007/978-1-4471-2256-240uhttps://doi.org/10.1007/978-1-4471-2256-2?nosfx=yxVerlag3Volltext0 a518.1 aThe 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