What is the name for a quadtree/octree like tree with an arbitrary number of child nodes?

Question

So if a node has 2*2 subnodes it is called a quadtree (2*2=4). If a node has 2*2*2 subnodes it is called an octree (2*2*2=8). Therefore if you work in 2D it is often good to use a quadtree and in 3D it is good practise to use an octree.

But are there any trees with an arbitrary number of subnodes in 3D? Like a tree with nnn subnodes. What is it called and are there any scientific works already for this?

Thanks in advance.

Answer 1

I believe you want the k-D tree:

https://en.wikipedia.org/wiki/K-d_tree