Waterman Polyhedra:
Convex Hulls in the IVM

by Kirby Urner
Originally posted: January 8, 2001
Last modified: June 19, 2005

Captions N = 2nd power of maximal vertex distances from origin in a ccp sphere packing

(ccp = ivm)


Vertex color coding: N, N-1, N-2, N-3, N-4

image
1
image
2
image
3
image
4
image
5
image
6
image
7
image
8
image
9
image
10
image
11
image
12
image
13

image

15

Generated using Python + Povray + Qhull by Kirby Urner

For a really good Java applet about all this, Mark Newbold's work

Python source code as text and/or HTML view (colorized)

Curriculum writing re the Watermans and their context in K-12

Steve Waterman defined and studied this series of polyhedra -- I got some models in the mail!
A related class of polys include the N vertices only

Steve has many more Watermans on display (made with the same software)

More Waterman Polys

Addendum, June 2005

Return to Relevant Resoures


Oregon Curriculum Network