Euclidean Shortest Paths Exact or Approximate Algorithms /

• Κύριοι συγγραφείς: Li, Fajie (Συγγραφέας), Klette, Reinhard (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: London : Springer London : Imprint: Springer, 2011.
• Θέματα: Computer science.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Pattern recognition.; Computer-aided engineering.; Computer Science.; Algorithm Analysis and Problem Complexity.; Numeric Computing.; Pattern Recognition.; Discrete Mathematics in Computer Science.; Math Applications in Computer Science.; Computer-Aided Engineering (CAD, CAE) and Design.

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 obsta...

Πίνακας περιεχομένων:

• 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.