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 <hpp/fcl/BVH/BVH_front.h>

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

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.

Constructor & Destructor Documentation

◆ BVHFrontNode()

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

inline

Member Data Documentation

◆ left

int hpp::fcl::BVHFrontNode::left

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

◆ right

int hpp::fcl::BVHFrontNode::right

◆ valid

bool hpp::fcl::BVHFrontNode::valid

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

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

include/hpp/fcl/BVH/BVH_front.h

Public Member Functions