Euclidean Shortest Paths

Exact or Approximate Algorithms de

,

Éditeur :

Springer


Paru le : 2011-11-03

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
158,24

Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description
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.
Pages
378 pages
Collection
n.c
Parution
2011-11-03
Marque
Springer
EAN papier
9781447122555
EAN EPUB
9781447122562

Informations sur l'ebook
Nombre pages copiables
3
Nombre pages imprimables
37
Taille du fichier
8253 Ko
Prix
158,24 €

Suggestions personnalisées