octree division 八叉樹分割
the octrees are in fact an umberalla term for a bunch of algorithms, and fairly handy for data manupulation. they are most commonly used in the field of computer graphics to partition objects in a 3d setting through recursive subdivision(s) of a given space into octants.
the mechanism behind it is quite simple, you start with a bounding box tightly around all of a given amount of points in space, and should the box contain more than n (an assigned value) points, then the box is subdivided into 8 smaller boxes, each exactly one eighth of the total volume. and the algorithm is iterated but terminates upon inclusion of the last possible point in the space.
the figures below demonstrate how an instance of this type of division can be achieved in rhino+grasshopper environment.
