Euclidean Shortest Paths: Exact or Approximate Algorithms
149.15 CHF
Versandkostenfrei
Lieferzeit: 7-14 Werktage
- Artikel-Nr.: 10425768
Beschreibung
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
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
Eigenschaften
Breite: | 155 |
Gewicht: | 599 g |
Höhe: | 235 |
Länge: | 21 |
Seiten: | 378 |
Sprachen: | Englisch |
Autor: | Fajie Li, Reinhard Klette |
Bewertung
Bewertungen werden nach Überprüfung freigeschaltet.
Zuletzt angesehen