fcl::BVHFrontNode Struct Reference

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. More...

#include <BVH_front.h>

List of all members.

Public Member Functions
	BVHFrontNode (int left_, int right_)
Public Attributes
int	left
	The nodes to start in the future, i.e. the wave front of the traversal tree.
int	right
bool	valid
	The front node is not valid when collision is detected on the front node.

---

Detailed Description

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.

Definition at line 50 of file BVH_front.h.

---

Constructor & Destructor Documentation

fcl::BVHFrontNode::BVHFrontNode	(	int	left_,
		int	right_
	)		[inline]

Definition at line 58 of file BVH_front.h.

---

Member Data Documentation

int fcl::BVHFrontNode::left

The nodes to start in the future, i.e. the wave front of the traversal tree.

Definition at line 53 of file BVH_front.h.

int fcl::BVHFrontNode::right

Definition at line 53 of file BVH_front.h.

bool fcl::BVHFrontNode::valid

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

Definition at line 56 of file BVH_front.h.

---

The documentation for this struct was generated from the following file:

• BVH_front.h