• DOI:10.1145/1959045.1959056
• Corpus ID: 6514501

Review of Geometric folding algorithms by authors: E.D. Demaine and J. O'Rourke

@article{Fasy2011ReviewOG,
  title={Review of Geometric folding algorithms by authors: E.D. Demaine and J. O'Rourke},
  author={Brittany Terese Fasy and David L. Millman},
  journal={SIGACT News},
  year={2011},
  volume={42},
  pages={43-46}
}

• Brittany Terese Fasy, David L. Millman
• Published 21 March 2011
• Computer Science
• SIGACT News

Geometric Folding Algorithms presents a comprehensive discussion of folding (and unfolding) algorithms in Euclidean space. The book is divided into three parts: Linkages, Paper, and Polyhedra. The Introduction (Chapter 0) gives a sample of the problems that will be considered later in the book–some solved, some open–and entices the reader to continue reading. The target audience for this book is a graduate or undergraduate student in computer science or mathematics. However, most of the book is accessible to a mathematically-sophisticated person with a basic knowledge of geometry and big O notation. We believe that people with even less mathematical background can skim through the book and glean something from the experience. In addition, the book is so visually appealing that it can be used as a coffee table conversation piece. That use, however, does not do the book justice. For a researcher interested in this area, this book provides a thorough coverage of the current knowledge. Open problems are presented, and waiting to be solved15.