Here I provide two types of resources: first, general “further reading” on the topics covered in each chapter, usually more technical and detailed presentations of similar material (there is rarely any less technical presentation available). Second, some of the original sources for the material are cited, even if they are at the graduate-student level. I try to indicate the level of expertise needed to benefit from each resource.

The most frequent citation you'll see below is to my own monograph, Geometric Folding Algorithms: Linkages, Origami, Polyhedra, coauthored with Erik Demaine, out of which this book grew. I'll refer to this throughout as Geometric Folding Algorithms. This monograph is targeted at graduate students and professional researchers, but strives to be largely accessible with considerably less preparation. It has 421 scholarly citations, and rather than repeat many of these here, I concentrate on what is directly relevant to the material presented in this book.

Chapter 1

Much of the material on reachability, including the Two-Kinks Theorem, is described in more detail in my college textbook Computational Geometry in C, Chapter 8. The Above & Beyond material on intractability is covered in Chapter 5 of Geometric Folding Algorithms. NP-completeness is covered in any algorithms textbook. I recommend one here but there are plenty of others.