{"product_id":"9781447122555","title":"Euclidean Shortest Paths: Exact or Approximate Algorithms","description":"\u003ch1\u003eEuclidean Shortest Paths: Exact or Approximate Algorithms\u003c\/h1\u003e \u003ch2\u003eLi, Fajie; Klette, Reinhard\u003c\/h2\u003e \u003cp\u003eThis 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2011-11-04\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9781447122555\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4471-2256-2\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 378\u003c\/p\u003e ","brand":"Springer London","offers":[{"title":"Default Title","offer_id":50149162909836,"sku":"9781447122555","price":161.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9781447122555.jpg?v=1779572242","url":"https:\/\/lateknightbooks.com\/products\/9781447122555","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}