octree (Q1143237)

From Wikidata
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
tree data structure in which each internal node has exactly eight children;most often used to partition a three-dimensional space by recursively subdividing it into eight octants; the three-dimensional analog of quadtrees
Language Label Description Also known as
English
octree
tree data structure in which each internal node has exactly eight children;most often used to partition a three-dimensional space by recursively subdividing it into eight octants; the three-dimensional analog of quadtrees

    Statements

    Identifiers