Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Dissections
A comprehensive, beautifully illustrated survey accessible to anyone familiar with high school geometry.
Piano-Hinged Dissections
A dissection involves cutting a polygon into pieces in such a way that those pieces form another polygon; for a hinged dissection, the pieces must be attached by hinges. A piano hinge is "a long narrow hinge with a pin running the entire length of its joint." So, unlike regular hinged dissections, which swing or twist (around single point of hinge)
Dissections
Can you cut an octagon into five pieces and rearrange them into a square? How about turning a star into a pentagon? These are just two of the infinite challenges of geometric dissections, the mathematical art of cutting figures into pieces that can be rearranged to form other figures, using as few pieces as possible. Through the ages, geometric dissections have fascinated puzzle fans and great mathematicians alike. Here are dissections known to Plato and exciting new discoveries alike. Greg Frederickson explains solution methods carefully, assuming only a basic knowledge of high school geometry. This beautifully illustrated book provides hours of enjoyment for every mathematical puzzle enthusiast.
Hinged Dissections
These novel and original dissections will be a gold mine for math puzzle enthusiasts and for math educators.
Mathematics, Magic and Mystery
Famed puzzle expert explains math behind a multitude of mystifying tricks: card tricks, stage "mind reading," coin and match tricks, counting out games, geometric dissections, etc. More than 400 tricks. 135 illustrations.
Flattening the Earth
Cartographers have long grappled with the impossibility of portraying the earth in two dimensions. To solve this problem, mapmakers have created map projections. This work discusses and illustrates the known map projections from before 500BC to the present, with facts on their origins and use.
Combinatorial Rigidity
This book presents rigidity theory in a historical context. The combinatorial aspects of rigidity are isolated and framed in terms of a special class of matroids, which are a natural generalization of the connectivity matroid of a graph. The book includes an introduction to matroid theory and an extensive study of planar rigidity. The final chapter is devoted to higher dimensional rigidity, highlighting the main open questions. Also included is an extensive annotated bibiolography with over 150 entries. The book is aimed at graduate students and researchers in graph theory and combinatorics or in fields which apply the structural aspects of these subjects in architecture and engineering. Accessible to those who have had an introduction to graph theory at the senior or graduate level, the book would be suitable for a graduate course in graph theory.
Discrete and Computational Geometry
This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2002, held in Tokyo, Japan, in December 2002. The 29 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in discrete algorithmic geometry are addressed.
