Part 1 on the website, HIP file available:
https://particula.org/tree/master/tutorials/unconventional_k-d_tree_partitioning_algorithm/
Project on Artstation + Renderings: https://www.artstation.com/artwork/KDbvR
In this second part of a mini tutorial series I demonstrate a few approaches to handle random extrusions for our space partitioning algorithm. These techniques are easily expandable and can be adapted to all sorts of projects.
The first technique covered utilises Sort SOP's built-in functionality to randomise the primitive order, while we subsequently perform extrusions inside foreach loops, assigning random values based on the current iteration detail attribute.
Next we go through a simple wrangle to handle the randomisation of the elements, utilising a little bit of vex. This allows us to perform the whole operation inside a single foreach loop.
Last but not least we utilise a Measure SOP to create a system that sorts the primitives based on their areas, that could personally render the nicest results.
I hope this video could've been of help or entertainment. Your feedback is really appreciated.
Thank you.
