Ir directamente a la información del producto
1 de 1

Springer

Euclidean Shortest Paths: Exact Or Approximate Algorithms

Euclidean Shortest Paths: Exact Or Approximate Algorithms

ISBN-13: 9781447160649
Precio habitual $211.98
Precio habitual Precio de oferta $211.98
Oferta Agotado
Los gastos de envío se calculan en la pantalla de pago.
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.


  • Author: Li Fajie, Reinhard Klette
  • Publisher: Springer
  • Publication Date: Jan 25, 2014
  • Number of Pages: 396 pages
  • Language: English
  • Binding: Paperback
  • ISBN-10: 1447160649
  • ISBN-13: 9781447160649
Ver todos los detalles