Hello all, I am hoping someone could help with what I am trying to achieve here.
The definition arrays progressively rotating blocks along a curve, packing them tightly.
To do this it takes a “block 0” and performs a polar array. It then takes the index 1 item of the array and arrays it along the path very densely and through a collision check it only keeps the first item of the list of the arrayed blocks that do not collide with block at index 0. It then merges index 0 and 1 for the next collision check and runs again with index 2 and so on and on and on until the whole curve path is covered.
I have managed to achieve this by means of copying and pasting part of the definition over and over but surely there has to be a better smarter way. I looked into hoopsnake but I am having trouble understanding how to use it in this context. Any help/pointers to useful tutorials on recursive definitions would be greatly appreciated!