Euclidean Shortest Paths: Exact or Approximate Algorithms

(7)
Euclidean Shortest Paths: Exact or Approximate Algorithms image
ISBN-10:

1447122550

ISBN-13:

9781447122555

Edition: 2011
Released: Nov 04, 2011
Publisher: Springer
Format: Hardcover, 396 pages
Related ISBN: 9781447160649

Description:

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.

Best prices to buy, sell, or rent ISBN 9781447122555




Frequently Asked Questions about Euclidean Shortest Paths: Exact or Approximate Algorithms

You can buy the Euclidean Shortest Paths: Exact or Approximate Algorithms book at one of 20+ online bookstores with BookScouter, the website that helps find the best deal across the web. Currently, the best offer comes from and is $ for the .

The price for the book starts from $143.19 on Amazon and is available from 13 sellers at the moment.

If you’re interested in selling back the Euclidean Shortest Paths: Exact or Approximate Algorithms book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.

As for the Euclidean Shortest Paths: Exact or Approximate Algorithms book, the best buyback offer comes from and is $ for the book in good condition.

The Euclidean Shortest Paths: Exact or Approximate Algorithms book is in very low demand now as the rank for the book is 10,860,367 at the moment. A rank of 1,000,000 means the last copy sold approximately a month ago.

Not enough insights yet.