convex hull jpgs and wrls of convex hulls from point sets derived by stacking symmetrical polyhedra...
This author believes that every symmetrical polyhedron can be stacked upon itself to make a point set
which will generate an unlimited series of derived polyhedron. Below, is some proof of concept
for this conjecture.
To see the 3-d version...click on their radius value.
Here are the first 16 initial convex hulls generated with a point matrix related to
stacking a
waterman 8 3-4 fold [ meaning the polygons bridging the 3-fold and 4-fold. ]
1 - A point set can be manifested by a polyhedron.
2 - That point set can be scaled into either a 1x1x1 or 2x2x2..."unit cell".
3 - The unit cell can be exploded into a larger point set.
4 - Any exploded point set can be combinded with any other exploded point set.
5 - Any combination of exploded point sets can be "serialized"...
[ made into a unique unlimited series of polyhedron ].
6 - ANY exploded point set can be automated to generate these unlimited series of convex hulls.
[ where each unique point distance from 0,0,0...is given a consecutive integer reference number. ]