Euclidean Shortest Paths - Exact or Approximate Algorithms (Hardcover, 2011)

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. 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.

General

Imprint:	Springer London
Country of origin:	United Kingdom
Release date:	November 2011
First published:	2011
Authors:	Fajie Li • Reinhard Klette
Dimensions:	235 x 155 x 22mm (L x W x T)
Format:	Hardcover
Pages:	378
Edition:	2011
ISBN-13:	978-1-4471-2255-5
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Promotions
LSN:	1-4471-2255-0
Barcode:	9781447122555

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!