Контакт
Как се пазарува?
Доставка
Наръчник за пазаруване
Euclidean Shortest Paths
Английски език
528 b
30 дни за връщане на стоката
Може би ще Ви заинтересува
/
С меки корици
29.14
лв
/
С меки корици
26.32
лв
/
С меки корици
197.10
лв
/
С меки корици
134.86
лв
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.
Информация за книгата
Английски език
Категории
