|
|
|
|
Computational Geometry: Algorithms and Applications, Second Edition
This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational... | | Geometric Folding Algorithms: Linkages, Origami, Polyhedra
How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Dürer in the... | | |
|
|
|
|
|
Result Page: 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 |