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>

Public Member Functions
	BVHFrontNode (unsigned int left_, unsigned int right_)

Public Attributes
unsigned int	left
	The nodes to start in the future, i.e. the wave front of the traversal tree. More...

unsigned int	right

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

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 53 of file BVH_front.h.

Constructor & Destructor Documentation

◆ BVHFrontNode()

hpp::fcl::BVHFrontNode::BVHFrontNode	(	unsigned int	left_,
		unsigned int	right_
	)

inline

Definition at line 62 of file BVH_front.h.

Member Data Documentation

◆ left

unsigned int hpp::fcl::BVHFrontNode::left

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

Definition at line 56 of file BVH_front.h.

◆ right

unsigned int hpp::fcl::BVHFrontNode::right

Definition at line 56 of file BVH_front.h.

◆ valid

bool hpp::fcl::BVHFrontNode::valid

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

Definition at line 60 of file BVH_front.h.

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

BVH_front.h

Public Member Functions