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