Abstract class implementing the parallel traverse of two binary trees. Selection of the data from the trees is performed by the rules defined in the Accept/Reject methods. See description of the required methods in the comments above. More...
#include <BVH_Traverse.hxx>
Inheritance diagram for BVH_PairTraverse< NumType, Dimension, BVHSetType, MetricType >:
Public Types | |
public types | |
| typedef BVH_Box< NumType, Dimension >::BVH_VecNt | BVH_VecNt |
Public Member Functions | |
Constructor | |
| BVH_PairTraverse () | |
| Constructor. More... | |
Setting the sets to access the elements and BVH trees | |
| void | SetBVHSets (BVHSetType *theBVHSet1, BVHSetType *theBVHSet2) |
| Sets the BVH Sets containing the BVH trees. More... | |
Rules for Accept/Reject | |
| virtual Standard_Boolean | RejectNode (const BVH_VecNt &theCornerMin1, const BVH_VecNt &theCornerMax1, const BVH_VecNt &theCornerMin2, const BVH_VecNt &theCornerMax2, MetricType &theMetric) const =0 |
| Rejection of the pair of nodes by bounding boxes. Metric is computed to choose the best branch. Returns true if the pair of nodes should be rejected, false otherwise. More... | |
| virtual Standard_Boolean | Accept (const Standard_Integer theIndex1, const Standard_Integer theIndex2)=0 |
| Leaf element acceptance. Returns true if the pair of elements is accepted, false otherwise. More... | |
Selection | |
| Standard_Integer | Select () |
| Selection of the pairs of elements of two BVH trees by the rules defined in Accept/Reject methods. The method requires the BVHSets containing BVH trees to be set. Returns the number of accepted pairs of elements. More... | |
| Standard_Integer | Select (const opencascade::handle< BVH_Tree< NumType, Dimension >> &theBVH1, const opencascade::handle< BVH_Tree< NumType, Dimension >> &theBVH2) |
| Performs selection of the elements from two BVH trees by the rules defined in Accept/Reject methods. Returns the number of accepted pairs of elements. More... | |
 Public Member Functions inherited from BVH_BaseTraverse< NumType > | |
| virtual Standard_Boolean | IsMetricBetter (const NumType &, const NumType &) const |
| Compares the two metrics and chooses the best one. Returns true if the first metric is better than the second, false otherwise. More... | |
| virtual Standard_Boolean | RejectMetric (const NumType &) const |
| Rejects the node by the metric. More... | |
| virtual Standard_Boolean | Stop () const |
| Returns the flag controlling the tree descend. Returns true if the tree descend should be stopped. More... | |
Protected Attributes | |
Fields | |
| BVHSetType * | myBVHSet1 |
| BVHSetType * | myBVHSet2 |
Additional Inherited Members | |
| Protected Member Functions inherited from BVH_BaseTraverse< NumType > | |
| BVH_BaseTraverse () | |
| Constructor. More... | |
| virtual | ~BVH_BaseTraverse () |
| Destructor. More... | |
Detailed Description
template<class NumType, int Dimension, class BVHSetType = void, class MetricType = NumType>
class BVH_PairTraverse< NumType, Dimension, BVHSetType, MetricType >
Abstract class implementing the parallel traverse of two binary trees. Selection of the data from the trees is performed by the rules defined in the Accept/Reject methods. See description of the required methods in the comments above.
- Template Parameters
-
NumType Numeric data type Dimension Vector dimension BVHSetType Type of set containing the BVH tree (required to access the elements by the index) MetricType Type of metric to perform more optimal tree descend
Member Typedef Documentation
◆ BVH_VecNt
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
| typedef BVH_Box<NumType, Dimension>::BVH_VecNt BVH_PairTraverse< NumType, Dimension, BVHSetType, MetricType >::BVH_VecNt |
Constructor & Destructor Documentation
◆ BVH_PairTraverse()
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
|
inline |
Constructor.
Member Function Documentation
◆ Accept()
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
|
pure virtual |
Leaf element acceptance. Returns true if the pair of elements is accepted, false otherwise.
Implemented in BRepExtrema_OverlapTool, and BOPTools_PairSelector< Dimension >.
◆ RejectNode()
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
|
pure virtual |
Rejection of the pair of nodes by bounding boxes. Metric is computed to choose the best branch. Returns true if the pair of nodes should be rejected, false otherwise.
Implemented in BVH_PairDistance< NumType, Dimension, BVHSetType >.
◆ Select() [1/2]
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
|
inline |
◆ Select() [2/2]
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
| Standard_Integer BVH_PairTraverse< NumType, Dimension, BVHSetType, MetricType >::Select | ( | const opencascade::handle< BVH_Tree< NumType, Dimension >> & | theBVH1, |
| const opencascade::handle< BVH_Tree< NumType, Dimension >> & | theBVH2 | ||
| ) |
Performs selection of the elements from two BVH trees by the rules defined in Accept/Reject methods. Returns the number of accepted pairs of elements.
◆ SetBVHSets()
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
|
inline |
Field Documentation
◆ myBVHSet1
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
|
protected |
◆ myBVHSet2
template<class NumType , int Dimension, class BVHSetType = void, class MetricType = NumType>
|
protected |
The documentation for this class was generated from the following file:
