terms |
octree |
As nouns the difference between terms and octree
is that
terms is while
octree is a treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it.
recursive |
octree |
As an adjective recursive
is drawing upon itself, referring back.
As a noun octree is
a treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it.
space |
octree |
As nouns the difference between space and octree
is that
space is
Of time.octree is a treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it.
As a verb space
is to roam, walk, wander.
partition |
octree |
As nouns the difference between partition and octree
is that
partition is partition (section of a hard disk separately formatted) while
octree is a treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it.
child |
octree |
As nouns the difference between child and octree
is that
child is a daughter or son; an offspring while
octree is a treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it.
treelike |
octree |
As an adjective treelike
is having some characteristics of a tree; resembling or similar to a tree.
As a noun octree is
a treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it.
octree |
quadtree |
see also |
As nouns the difference between octree and quadtree
is that
octree is a treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it while
quadtree is a treelike data structure each of whose nodes has up to four children, most often used to partition a two-dimensional space by recursively subdividing it.