algorithmic modeling for Rhino
As mentioned in my earlier post I tinkered up a little quadtree definition, which in fact became an octree definition. The main component 'OCTREE' delivers 3 output streams: 'final' represents all the boxes that are the result of the point-specific number of recursions. 'iterated' represents all boxes that have been collected on the way of recursions, as long as they contained the point in question. 'skipped' represents all boxes that ehh..that have been skipped because they didn't contain the point in question. The fact that these 'skipped' boxes probably contain another point is subject to another revision this definition probably needs.
Updated definition with missing cluster: