New York: Springer, 2011. — 395 p.
Reviews algorithms for the exact or approximate solution of Euclidean shortest-path problems, with a specific focus on rubberband algorithms
Provides theoretical and programming exercises at the end of each chapter
Discusses each concept and algorithm in depth, including mathematical proofs for many of the given statements