Public Member Functions | Public Attributes | List of all members
fcl::detail::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>

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.

Definition at line 55 of file BVH_front.h.

Constructor & Destructor Documentation

◆ BVHFrontNode()

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

Definition at line 47 of file BVH_front.cpp.

Member Data Documentation

◆ left

int fcl::detail::BVHFrontNode::left

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

Definition at line 59 of file BVH_front.h.

◆ right

int fcl::detail::BVHFrontNode::right

Definition at line 59 of file BVH_front.h.

◆ valid

bool fcl::detail::BVHFrontNode::valid

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

Definition at line 63 of file BVH_front.h.


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


fcl
Author(s):
autogenerated on Fri Apr 2 2021 02:38:02