thumb|Left: Recursive subdivision of a cube into octant (solid geometry)|octants. Right: The corresponding octree.
via Wikipedia infobox
thumb|Left: Recursive subdivision of a cube into octant (solid geometry)|octants. Right: The corresponding octree.
An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three-dimensional space by recursively subdividing it into eight octants. Octrees are the three-dimensional analog of quadtrees. The word is derived from oct (Greek root meaning "eight") + tree. Octrees are often used in 3D graphics and 3D game engines.
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).