It is a customizable version of the Hilbert cube, a space filling curve that has many unique properties, such as preserving grouping. Also, it looks cool.
Implemented:
Iterations and spacing (4/19/15)
Separate beam and corner sizes (4/20/15)
Randomization options (4/20/15)
Readable comments in code (4/20/15)
Suggest things to implement in the comments!
What won't be implemented:
Exact edge length (Increases processing time 10x for some reason.)
Support (Most programs generate support just fine. Also it requires exact edge length.)
Approximate processing times (for default parameters, with only iteration # changed)
0 or 1 iteration- <1 min
2 iterations- 5 min
3 iterations- 15 min
The preview is much quicker, thankfully
Credit where credit is due:
Inspired by http://www.thingiverse.com/thing:16343
Algorithms adapted from http://thomasdiewald.com/blog/?p=561
| Hilbert.scad | 3.7KB | |
| Hilbert0.stl | 7.4KB | |
| Hilbert1.stl | 60.7KB | |
| Hilbert2.stl | 487.6KB | |
| Hilbert3.stl | 3.9MB |
