Euclidean Shortest Paths
Exact or Approximate Algorithms
Inbunden, Engelska, 2011
1 759 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Beskrivning
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.
Produktinformation
Utforska kategorier
Recensioner i media
Innehållsförteckning
Hoppa över listan
Du kanske också är intresserad av
- 10% rabatt på allt
- 10% rabatt på allt
Del 3
- Signerad!
Del 3
- 10% rabatt på allt
Del 11
- 10% rabatt på allt
- 10% rabatt på allt
Del 4
- Nyhet
- -30%