octree (Q1143237)

From Wikidata
Jump to: navigation, search
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
edit
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

     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit