| i | j | k | time (s) | stl (bytes) | WSF ($) | |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1.47 | 73384 | |
| 2 | 2 | 2 | 2 | 28.74 | 435384 | 2.61 |
| 3 | 3 | 3 | 3 | 173.32 | 1342184 | 4.99 |
| 4 | 4 | 4 | 4 | 873.20 | 3052984 | 9.46 |
| 5 | 5 | 5 | 5 | 2952.67 | 5826984 | 16.69 |
| 6 | 6 | 6 | 6 | 6694.16 | 9923484 | 27.32 |
The size of the file and the cost to print the part scales linearly with the number of unit cells, however the time to perform the union shows quadratic scaling. This quickly becomes intractable for moderately sized arrays of cells.
Now I'm in need of a scalable algorithm to do fast boolean operations for constructive solid geometry.
Update: I had to add a frame around the bounding box of the parts to make them a bit more robust for cleaning and handling at Shapeways.
![]() |
| "it will break during unpacking/cleaning like this" |
Update II: Here's the 6x6x6 part in Shapeway's white-strong-flexible:





I updated the post to include a pic of the 6x6x6 octet truss cube w/frame that I ordered in the white-strong-flexible material. It's pretty neat to be able to go from graphics on the screen to part in your hand in such a short time.
ReplyDeleteWell, here's one solution to the poor scaling of the Boolean union operations: don't do them! The methods demonstrated in that thesis use unit cells that have coincident surfaces in the stls so each unit cell is actually a manifold part that butts into its neighbor.
ReplyDelete