Euclidean Shortest Paths

Exact or Approximate Algorithms

Nonfiction, Computers, Advanced Computing, Engineering, Computer Vision, General Computing, Programming
Cover of the book Euclidean Shortest Paths by Reinhard Klette, Fajie Li, Springer London
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Reinhard Klette, Fajie Li ISBN: 9781447122562
Publisher: Springer London Publication: November 3, 2011
Imprint: Springer Language: English
Author: Reinhard Klette, Fajie Li
ISBN: 9781447122562
Publisher: Springer London
Publication: November 3, 2011
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer London

Cover of the book Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012 by Reinhard Klette, Fajie Li
Cover of the book Difficult Decisions in Thoracic Surgery by Reinhard Klette, Fajie Li
Cover of the book Hypermobility of Joints by Reinhard Klette, Fajie Li
Cover of the book Side Effects of Medical Cancer Therapy by Reinhard Klette, Fajie Li
Cover of the book The Minnesota Code Manual of Electrocardiographic Findings by Reinhard Klette, Fajie Li
Cover of the book Supporting People with Dementia Using Pervasive Health Technologies by Reinhard Klette, Fajie Li
Cover of the book Secondary Mitral Valve Regurgitation by Reinhard Klette, Fajie Li
Cover of the book FRCR Part I by Reinhard Klette, Fajie Li
Cover of the book Pathology of the Ovary, Fallopian Tube and Peritoneum by Reinhard Klette, Fajie Li
Cover of the book Sampled-Data Models for Linear and Nonlinear Systems by Reinhard Klette, Fajie Li
Cover of the book Minimally Invasive Surgery for Achilles Tendon Disorders in Clinical Practice by Reinhard Klette, Fajie Li
Cover of the book Guide to Reliable Internet Services and Applications by Reinhard Klette, Fajie Li
Cover of the book Offshore Medicine by Reinhard Klette, Fajie Li
Cover of the book Robust and Optimal Control by Reinhard Klette, Fajie Li
Cover of the book Liver Metastases by Reinhard Klette, Fajie Li
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy