|
| Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt. |
Euclidean Shortest Paths
ISBN-13:
9781447122562
Veröffentl:
2011
Seiten:
378
Autor:
Fajie Li
eBook Typ:
PDF
eBook Format:
EPUB
Kopierschutz:
1 - PDF Watermark
Sprache:
Englisch
Beschreibung:
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.
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.
Kunden Rezensionen
Mehr zum Thema
Folgen Sie uns auf:
