Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Connections: the geometric bridge between art and science
Kappraff J., McGraw-Hill, Inc., New York, NY, 1991. Type: Book (9780070342514)
Date Reviewed: Jul 1 1991

Kappraff is among those who delight in discovering geometry in every corner of the world: in art, architecture, biology, music, and engineering design. His book explores the “grammar of space” through a study of similarity and symmetry, graphs, tiling, and polyhedra. Although ostensibly a treatise on “design science,” the book is primarily a catalog of fascinating geometric topics, presented with the glee of a child describing a toy collection.

Among the toys described is Fuller’s jitterbug, a flexible model of a cuboctahedron that can be deformed magically to an icosahedron, an octahedron, and a tetrahedron in sequence. Fractals, Penrose tilings, Steiner trees, origami, tensegrity, and the Poincaré plane are each touched upon. The material ranges from elementary (the golden ratio) to difficult (the Slizard and Császár polyhedra) to recent research (spiderwebs and reciprocal diagrams). Along the way are fascinating curios: how to make an icosahedron from three interpenetrating and mutually orthogonal golden rectangle index cards, how a Hamiltonian path of edges of an n-cube determines the disk moves for an n-peg Towers of Hanoi puzzle, why a steer’s horns grow in a logarithmic spiral, and why K11 should be realizable as a triangulated polyhedron of genus 6 (no construction has yet been found).

Kappraff is a mathematician, and he presents elegant proofs in smaller type, presumably to permit his architecture students to skip them without guilt. Although I wonder how comprehensible students will find a text that moves from group axioms to quotient groups in just three pages, I have no doubt that they will be dazzled by this engaging compendium of geometric delights.

Reviewer:  Joseph O’Rourke Review #: CR115036
Bookmark and Share
  Featured Reviewer  
 
Geometrical Problems And Computations (F.2.2 ... )
 
 
Computational Geometry And Object Modeling (I.3.5 )
 
 
Graph Theory (G.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Geometrical Problems And Computations": Date
Some performance tests of convex hull algorithms
Allison D., Noga M. BIT 24(1): 2-13, 1984. Type: Article
Feb 1 1985
A fast voronoi-diagram algorithm with quaternary tree bucketing
Ohya T., Iri M., Murota K. Information Processing Letters 18(4): 227-231, 1984. Type: Article
Jan 1 1985
Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
Chazelle B. (ed) SIAM Journal on Computing 13(3): 488-507, 1984. Type: Article
Mar 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy