000 04168nam a22005175i 4500
001 u372359
003 SIRSI
005 20160812084054.0
007 cr nn 008mamaa
008 111102s2011 xxk| s |||| 0|eng d
020 _a9781447122562
_9978-1-4471-2256-2
040 _cMX-MeUAM
050 4 _aQA76.9.A43
082 0 4 _a005.1
_223
100 1 _aLi, Fajie.
_eauthor.
245 1 0 _aEuclidean Shortest Paths
_h[recurso electrónico] :
_bExact or Approximate Algorithms /
_cby Fajie Li, Reinhard Klette.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2011.
300 _aXVIII, 378 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 0 _aOptical pattern recognition.
650 0 _aComputer aided design.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aNumeric Computing.
650 2 4 _aPattern Recognition.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aMath Applications in Computer Science.
650 2 4 _aComputer-Aided Engineering (CAD, CAE) and Design.
700 1 _aKlette, Reinhard.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781447122555
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-1-4471-2256-2
596 _a19
942 _cLIBRO_ELEC
999 _c200239
_d200239