Blick ins Buch

Euclidean Shortest Paths

Exact or Approximate Algorithms

Fajie Li, Reinhard Klette (Autoren)

Buch | Hardcover

378 Seiten

2011
Springer London Ltd (Verlag)
978-1-4471-2255-5 (ISBN)

Lese- und Medienproben

Blick ins Buch (midvox)

Artikel merken

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. presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms;

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.

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.

Zusatzinfo	XVIII, 378 p.
Verlagsort	England
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
	Informatik ► Weitere Themen ► CAD-Programme
	Mathematik / Informatik ► Mathematik ► Analysis
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Art Gallery Problems • Computational Geometry • Cube Curves • Euclidean Shortest Path • Parts Cutting Problem • q-Rectangles • rubberband algorithm • Safari Problem • Simple Polygon • Surface of Polytope • Touring Polygons • Zookeeper Problem
ISBN-10	1-4471-2255-0 / 1447122550
ISBN-13	978-1-4471-2255-5 / 9781447122555
Zustand	Neuware