![]() |
Polyhedron Models for the Classroom by Magnus J. Wenninger |
The Thirteen Archimedean Solids
|
Code Y = yellow, B = blue, O = orange, G = green, W = white |
As in the case of the Platonic solids, so too in that of the Archimedeans the beauty of the set is greatly enhanced by suitable color arrangements for the faces/ Since it is evident that many different color arrangements are possible, you may find it interesting to work out a suitable arrangement for yourself. The general principle is to work for some kind of symmetry and to avoid having adjacent faces with the same color. This may remind you of the map-coloring problem. The fact is that a polyhedron surface is a map, and as such is studied in the branch of mathematics known as topology. In making these models, however, you need not enter into any deep mathematical analysis to get what you want. Your own good sense will suggest suitable procedures. (See page 8.)
The actual technique of construction is the same here as that given above: namely, only one polygon—a triangle, square, pentagon, hexagon, octagon, or decagon—will serve as a net. However, it is important to note that in any one model all the edges must be of the same length. If you want to make a set having all edges equal, you will find the volUmes growing rather large with some models in the set. Of course a large model takes up more display space, so you must gauge your models with that fact in mind. On the other hand, you may want to vary the edge length from model to model and thus obtain polyhedra of more or less uniform volume or actually of uniform height. Here experiment is in order, and a student can have an excellent demonstration appealing to his own experience of the geometrical theorems on the relation of similar figures or solids: linear dimensions are directly proportional to each other; areas are proportional to squares on linear dimensions; volumes, to cubes on linear dimensions.
| Polyhedron Models for the Classroom by Magnus J. Wenninger |
![]() |
Next Other Pages Previous |
![]() |
||
| © Ragnar Torfason 2006 June 3 | ||