Euclidean Shortest Paths Exact or Approximate Algorithms

You must be logged in to access this title.

Sign up now

Already a member? Log in

Synopsis

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.

Book details

Edition:
2011
Author:
Fajie Li, Reinhard Klette
ISBN:
9781447122562
Related ISBNs:
9781447122555
Publisher:
Springer London
Pages:
N/A
Reading age:
Not specified
Includes images:
Yes
Date of addition:
2021-02-22
Usage restrictions:
Copyright
Copyright date:
2011
Copyright by:
Springer London, London 
Adult content:
No
Language:
English
Categories:
Computers and Internet, Nonfiction