Creating Unconventional k-d tree partitioning algorithm in Houdini

[ #Houdini #Tutorial ]In this video Ricardo Ponce walks us through an unconventional approach to making a k-d tree (a space partitioning structure) algorithm utilizing mainly the Carve SOP and a few loops inside Houdini 16.5.
Usually, traditional K-dimensional algorithms will normally use neighboring points to define the search trees and set its constraints. Instead, he randomizes the position of every perpendicular hyperplane that will split the primitive into two pieces at every iteration, for as many times as preferred.

>> See Also: Working with Parallel Transport in Houdini

[post_ads]

More Houdini tutorial [post_ads_2]