Whats a book about tying a tie doing in a list of recommended books on algorithms?
The answer is that this book clearly demonstrates how to analyze and solve a complex problem. Fink and Mao develop a mathematical notation for different tie knots, identify key criteria related to aesthetics and tie length, then use those criteria to generate all possible tie knots, identifying the 13 with the greatest aesthetic qualities. The book also contains an entertaining history of ties: you’ll certainly want to try some different tie knots after reading the book. Other Reviews • A Programmer’s Geometry Adrian Bowyer and John Woodwark, Butterworth-Heinemann, 1983. If you just want to find intersections of lines, intersections of lines with planes, and so forth then something like Laszlo is overkill. This older title gives you what you need, including consideration of all the degenerate conditions which have to be taken into account, and which are often omitted from more cursory treatments of the topic. This book is out of print and can be a little hard to find. The library of a
