Libraries.Game.Collision.DynamicBoundingVolumeTree3D

DynamicBoundingVolumeTree2D is the tree structure for storing the bounding boxes for 2D objects that are able to collide. The tree is a complete binary tree and stores the bounding boxes in a hierarchal structure with the parent node containing a bounding box that bounds the bounding boxes of both of its children.

This action compares two object hash codes and returns an integer. The result is larger if this hash code is larger than the object passed as a parameter, smaller, or equal. In this case, -1 means smaller, 0 means equal, and 1 means larger. This action was changed in Quorum 7 to return an integer, instead of a CompareResult object, because the previous implementation was causing efficiency issues.

Example Code

Object o
        Object t
        integer result = o:Compare(t) //1 (larger), 0 (equal), or -1 (smaller)

This action computes the height of the tree

This action returns the number of nodes in the DynamicBoundingVolumeTree3D tree.

This action counts the number of nodes in the DynamicBoundingVolumeTree3D recursively.

This action creates a new node for the Dynamic Bounding Volume Tree with the given BoundingBox and given Item and inserts the new node as a leaf for the tree.

This action removes the node from the Dynamic Bounding Volume Tree with the given node ID.

This action removes the given node from the tree.

This action determines if two objects are equal based on their hash code values.

Example Code

use Libraries.Language.Object
        use Libraries.Language.Types.Text
        Object o
        Text t
        boolean result = o:Equals(t)

This action returns the bounding box contained in the given tree node. Note that this bounding box is slightly larger than the bounding box of the item contained in this node.

This action returns the bounding box contained in the tree node with the given ID. Note that this bounding box is slightly larger than the bounding box of the item contained in this node

This action gets the hash code for an object.

Example Code

Object o
        integer hash = o:GetHashCode()

This action computes the height of the tree

This action returns the Item2Dcontained in the tree node with the given ID

This action returns the Item2Dcontained in the given tree node

This action computes the maximum balance of the tree. The maximum balance is the maximum difference of the heights of the two children of any node.

This action returns the bounding box contained in the given tree node. Note that this bounding box is slightly larger than the bounding box of the item contained in this node.

This actoin computes the ratio of the sum of the node perimeters to the root perimeter.

This action moves the object. If the object moves outside of its existing big bounding box, then the object is removed from the tree, a new bounding box is calculated, and it is reinserted into the tree. Otherwise, the action returns immediately.

This action moves the object contained in the node with the given node ID by the given displacement vector. If the node moves outside of its existing bounding box, then the object is removed from the tree, a new bounding box is calculated, and it is reinserted into the tree. Otherwise, the node is left where it is in the tree.

This action queries the tree for bounding boxes that overlap with the given bounding box and returns all leafs whose bounding boxes intersect the given bounding box in a list.