public class AdaptiveAabbTree<T> : BasePartition<T>, 
	ISupportClosestPointQueries<T>

Public Class AdaptiveAabbTree(Of T)
	Inherits BasePartition(Of T)
	Implements ISupportClosestPointQueries(Of T)

generic<typename T>
public ref class AdaptiveAabbTree : public BasePartition<T>, 
	ISupportClosestPointQueries<T>

type AdaptiveAabbTree<'T> =  
    class
        inherit BasePartition<'T>
        interface ISupportClosestPointQueries<'T>
    end

Type Parameters

T

The type of item in the spatial partition.

The AdaptiveAabbTreeT is based on

• Thomas Larsson: "Adaptive Bounding Volume Hierarchies for Efficient Collision Queries", Ph D Thesis, Mälardalen University Press, January, 2009
• Thomas Larsson, Tomas Akenine-Möller: "A dynamic bounding volume hierarchy for generalized collision detection", Computers & Graphics, Volume 30, Issue 3, p.451-460, June, 2006

The AdaptiveAabbTreeT was designed to manage deformable objects efficiently. It should be used for CompositeShapes or TriangleMeshShapes when the contained shapes or triangles are updated at runtime.

AdaptiveAabbTreeT vs. DynamicAabbTreeT: The AdaptiveAabbTreeT and the DynamicAabbTreeT are similar data structures. As a general rule, the AdaptiveAabbTreeT should be used if

• The entire spatial partition is invalidated regularly by calling Invalidate.
• The spatial partition is used to compute inter-object overlaps and intra-object overlaps (see EnableSelfOverlaps) are disabled.

• Individual items are invalidated frequently by calling Invalidate(T).
• Inter-objects and/or intra-object overlaps (see EnableSelfOverlaps) are computed.

The AdaptiveAabbTreeT should not be used as the collision detection broad-phase (see BroadPhase). Whereas, a DynamicAabbTreeT can be used as the collision detection broad-phase.

However, please note these are just general guidelines. You should always try different ISpatialPartitionT types and measure which one yields the best performance in your application.

Special handling of self-overlaps in GetOverlaps(ISpatialPartitionT): If GetOverlaps(ISpatialPartitionT) is used to test an AABB tree against itself then overlaps of an item with itself are not returned; that means, each item A overlaps with itself but (A, A) is not returned. And if two different items overlap, only one overlap is returned, for example: If item A and item B overlap (A, B) or (B, A) is returned but not both.

Reference