ABT?

ABT stands for adaptive binary trees, I think the main difference was that abt's can overlap. It's in the Combining octtrees and BSP trees thread is where he gives the name, and I think first introduces them.

An ABT is essentially closer to being an AABB tree than a K-d tree or a variant thereof, mainly because of the overlapping nodes that localize geometry rather than just space. The construction process is top-down and is quite similar to a K-d tree, but results in a binary AABB tree. You can make the AABB nodes not overlap, but they will still not form a K-d tree because of their tight-fitting nature. Despite these facts, the ABT is a specific approach to constructing the AABB tree, and as such I think it's fine to continue calling it by the specific name.

[Edited by - Assassin on March 20, 2005 10:02:36 PM]

I see, basically I was doing this already with AABTs, so I guess I am doing ABTs :-)

I don't care what it is called as long as it works.