Zobacz książki o podobnej tematyce

Więcej informacji o Euclidean Shortest Paths

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 561 punkty

Opis

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.

Szczegóły książki

Kategoria Knihy po anglicky Mathematics & science Mathematics Calculus & mathematical analysis

• Pełny tytuł: Euclidean Shortest Paths
• Podtytuł: Exact or Approximate Algorithms
• Autor: Fajie Li, Reinhard Klette
• Język: Angielski
• Oprawa: Twarda
• Liczba stron: 378
• EAN: 9781447122555
• ISBN: 1447122550
• ID: 01425682
• Wydawca: Springer London Ltd
• Waga: 758 g
• Wymiary: 235 × 155 × 24 mm
• Data wydania: 28. October 2011

Ulubione w innej kategorii

---

---

---