Euclidean Shortest Paths, 2011 Exact or Approximate Algorithms
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.
Date de parution : 01-2014
Ouvrage de 378 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 168,79 €
Ajouter au panierDate de parution : 11-2011
Ouvrage de 378 p.
15.5x23.5 cm
Thèmes d’Euclidean Shortest Paths :
Mots-clés :
Art Gallery Problems; Computational Geometry; Cube Curves; Euclidean Shortest Path; Parts Cutting Problem; Rubberband Algorithm; Safari Problem; Simple Polygon; Surface of Polytope; Touring Polygons; Watchman Route Problem; Zookeeper Problem; q-Rectangles; algorithm analysis and problem complexity