A meditation in Houdini’s foreachSOP.
Points are grouped by their distance to each other.
Each group’s points then are sorted by their distance to the group’s ‘main point’.
A addSOP connects the main point to it’s children.
Why oh why didn’t I use a pythonSOP ? And what about searchable data structures – like trees?
This Procedural Plagiarism was inspired by the image on the cover of: “Processing: A Programming Handbook for Visual Designers and Artists” by Casey Reas and Ben Fry.
Downloads
Videos
Images
