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 Decision Policies for Production Networks by Reinhard Klette, Fajie Li
Cover of the book Bringing Leadership to Life in Health: LEADS in a Caring Environment by Reinhard Klette, Fajie Li
Cover of the book Web Accessibility by Reinhard Klette, Fajie Li
Cover of the book Inflammatory Breast Cancer by Reinhard Klette, Fajie Li
Cover of the book Medical Imaging in Clinical Trials by Reinhard Klette, Fajie Li
Cover of the book Hypermobility of Joints by Reinhard Klette, Fajie Li
Cover of the book Bayesian Inference for Probabilistic Risk Assessment by Reinhard Klette, Fajie Li
Cover of the book Self-* and P2P for Network Management by Reinhard Klette, Fajie Li
Cover of the book Reliability and Safety of Complex Technical Systems and Processes by Reinhard Klette, Fajie Li
Cover of the book Nearly Zero Energy Building Refurbishment by Reinhard Klette, Fajie Li
Cover of the book Managing the Dynamics of New Product Development Processes by Reinhard Klette, Fajie Li
Cover of the book Semantic Models for Adaptive Interactive Systems by Reinhard Klette, Fajie Li
Cover of the book Pediatric Endourology Techniques by Reinhard Klette, Fajie Li
Cover of the book Protein-protein Interactions and Networks by Reinhard Klette, Fajie Li
Cover of the book Essential Dynamic HTML fast 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