• Page
• Discussion
• View source
• History

From Odwiki

This SOP is useful for generating both regular and randomized subdivisions of any polygonal input It recursively cleaves polygons into sub-polygons, each time cleaving through the polygon center. If polygons are split into two pieces each time, the result is a tessellation similar to a Binary Space Partition (BSP) tree. Higher values for 'split' than 2 result in pie-slice cleaving into N pieces at each recursive step.

For more information go to the Cleave SOP homepage. Note: this sop is now distributed with the HoudiniOceanToolkit.