Cantitate/Preț
Produs
Total produse
Vezi coșul
Euclidean Shortest Paths: Exact or Approximate Algorithms de Fajie Li

Euclidean Shortest Paths: Exact or Approximate Algorithms

Autor Fajie Li, Reinhard Klette
en Limba Engleză Paperback – 25 ian 2014
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 100909 lei  6-8 săpt.
  SPRINGER LONDON – 25 ian 2014 100909 lei  6-8 săpt.
Hardback (1) 101529 lei  6-8 săpt.
  SPRINGER LONDON – 4 noi 2011 101529 lei  6-8 săpt.

Preț: 100909 lei

Preț vechi: 126137 lei
-20% Nou

Puncte Express: 1514
Preț estimativ în valută:
19313€ • 20374$ • 16094£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781447160649
ISBN-10: 1447160649
Pagini: 396
Ilustrații: XVIII, 378 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:2011
Editura: SPRINGER LONDON
Colecția Springer
Locul publicării:London, United Kingdom

Public țintă

Research

Cuprins

Part I: Discrete or Continuous Shortest Paths.- Euclidean Shortest Paths.- Deltas and Epsilons.- Rubberband Algorithms.- Part II: Paths in the Plane.- Convex Hulls in the Plane.- Partitioning a Polygon or the Plane.- Approximate ESP Algorithms.- Part III: Paths in Three-Dimensional Space.- Paths on Surfaces.- Paths in Simple Polyhedrons.- Paths in Cube Curves.- Part IV: Art Galleries.- Touring Polygons.- Watchman Route.- Safari and Zookeeper Problems.

Recenzii

From the book reviews:
“This book presents selected algorithms for the exact or approximate solution of several variants of the Euclidean shortest path problem (ESP). … The book has been successful in addressing the Euclidean Shortest Path problems by presenting exact and approximate algorithms in the light of rubberband algorithms, and will be immensely useful to students and researchers in the area.” (Arindam Biswas, IAPR Newsletter, Vol. 37 (1), January, 2015)
“Li (Huaqiao Univ., China) and Klette (Univ. of Auckland, New Zealand) have written an interesting and very reader-friendly book on algorithms that find a shortest path between two vertices of a graph. … this is the first book-length treatment of the topic. The entire text is accessible to advanced undergraduates. … Summing Up: Highly recommended. Upper-division undergraduates, graduate students, and researchers/faculty.” (M. Bona, Choice, Vol. 49 (9), May, 2012)

Textul de pe ultima copertă

The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2- or 3-dimensional space? Variants of this industrially-significant computational geometry problem also require the path to pass through specified areas and avoid defined obstacles.
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. Suitable for a second- or third-year university algorithms course, the text enables readers to understand not only the algorithms and their pseudocodes, but also the correctness proofs, the analysis of time complexities, and other related topics.
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
This hands-on guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortest-path problems in practical applications will also find the book a useful resource.
Dr. Fajie Li is at Huaqiao University, Xiamen, Fujian, China. Prof. Dr. Reinhard Klette is at the Tamaki Innovation Campus of The University of Auckland.

Caracteristici

Reviews algorithms for the exact or approximate solution of Euclidean shortest-path problems, with a specific focus on rubberband algorithms Provides theoretical and programming exercises at the end of each chapter Discusses each concept and algorithm in depth, including mathematical proofs for many of the given statements Includes supplementary material: sn.pub/extras