Spacial partitionning bottom up tree

173 Views Asked by At

I was wondering, because I can't find anything about a spacial partionning tree that would be bottom up built:

Is it possible (I guess yes but with what efficiency?)
Does it exist in practical case?
Any documentation about this?

Is this question senseless?

EDIT:
by spacial partitioning, I mean tree similar to BSP, Quad Tree, kd-tree, AABB-tree... But it seems to me that theses trees are build from large area to smaller ones (so top-down).

My question was:
Are there bottom up algorithm to achieve similar algorithm?

0

There are 0 best solutions below