DynamicTreeT Class |
Namespace: Internal.tainicom.Aether.Physics2D.Collision
The DynamicTreeT type exposes the following members.
Name | Description | |
---|---|---|
DynamicTreeT |
Constructing the tree initializes the node pool.
|
Name | Description | |
---|---|---|
AreaRatio |
Get the ratio of the sum of the node areas to the root area.
| |
Height |
Compute the height of the binary tree in O(N) time. Should not be called often.
| |
MaxBalance |
Get the maximum balance of an node in the tree. The balance is the difference
in height of the two children of a node.
|
Name | Description | |
---|---|---|
AddProxy |
Create a proxy in the tree as a leaf node. We return the index
of the node instead of a pointer so that we can grow
the node pool.
/// | |
ComputeHeight |
Compute the height of the entire tree.
| |
ComputeHeight(Int32) |
Compute the height of a sub-tree.
| |
Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) | |
Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) | |
GetFatAABB(Int32) |
Get the fat AABB for a proxy.
| |
GetFatAABB(Int32, AABB) |
Get the fat AABB for a proxy.
| |
GetHashCode | Serves as the default hash function. (Inherited from Object.) | |
GetType | Gets the Type of the current instance. (Inherited from Object.) | |
GetUserData |
Get proxy user data.
| |
MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |
MoveProxy |
Move a proxy with a swepted AABB. If the proxy has moved outside of its fattened AABB,
then the proxy is removed from the tree and re-inserted. Otherwise
the function returns immediately.
| |
Query |
Query an AABB for overlapping proxies. The callback class
is called for each proxy that overlaps the supplied AABB.
| |
RayCast |
Ray-cast against the proxies in the tree. This relies on the callback
to perform a exact ray-cast in the case were the proxy contains a Shape.
The callback also performs the any collision filtering. This has performance
roughly equal to k * log(n), where k is the number of collisions and n is the
number of proxies in the tree.
| |
RebuildBottomUp |
Build an optimal tree. Very expensive. For testing.
| |
RemoveProxy |
Destroy a proxy. This asserts if the id is invalid.
| |
SetUserData |
Set proxy user data.
| |
ShiftOrigin |
Shift the origin of the nodes
| |
TestFatAABBOverlap |
Test overlap of fat AABBs.
| |
ToString | Returns a string that represents the current object. (Inherited from Object.) | |
Validate |
Validate this tree. For testing.
| |
ValidateMetrics | ||
ValidateStructure |
Name | Description | |
---|---|---|
MethodInvoke |
Calls the object method by name.
(Defined by ObjectEx.) | |
PropertyGet(String, Object, Boolean) | Overloaded.
Gets the value of the object property by name.
(Defined by ObjectEx.) | |
PropertyGetT(String, Object, Boolean) | Overloaded.
Gets the value of the object property by name.
(Defined by ObjectEx.) | |
PropertySet |
Sets the value of the object property by name.
(Defined by ObjectEx.) |