Aspects


vs


Kdtree

A k-d-tree (k-dimensional tree) is a data structure for storing points in multidimensional space

Octree

An octree is a tree data structure in which each node has eight child nodes

Others

Quality Example
Less memory

"Kdtree needs less memory than octree and sometimes is even faster"

from question "Data structure for fast searching in C++"

Back to Home
Data comes from Stack Exchange with CC-BY-SA-3.0