pub struct DBVTBroadPhase<N: Real, BV, T> { /* private fields */ }
Expand description

Broad phase based on a Dynamic Bounding Volume Tree.

It uses two separate trees: one for static objects and which is never updated, and one for moving objects.

Implementations§

Creates a new broad phase based on a Dynamic Bounding Volume Tree.

Number of interferences detected by this broad phase.

Trait Implementations§

Updates the object additions, removals, and interferences detection.
Tells the broad phase to add a bounding-volume at the next update.
Tells the broad phase to remove the given set of handles.
Sets the next bounding volume to be used during the update of this broad phase.
Forces the broad-phase to recompute and re-report all the proximities with the given object.
Forces the broad-phase to recompute and re-report all the proximities.
Collects every object which might intersect a given bounding volume.
Collects every object which might intersect a given ray.
Collects every object which might contain a given point.

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self
The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.