Struct BVHFrontNode

Defined in File BVH_front.h

Struct Documentation

struct BVHFrontNode

Front list acceleration for collision Front list is a set of internal and leaf nodes in the BVTT hierarchy, where the traversal terminates while performing a query during a given time instance. The front list reflects the subset of a BVTT that is traversed for that particular proximity query.

Public Functions

inline BVHFrontNode(unsigned int left_, unsigned int right_)

Public Members

unsigned int left: The nodes to start in the future, i.e. the wave front of the traversal tree.

unsigned int right

bool valid: The front node is not valid when collision is detected on the front node.