|
| BRepExtrema_OverlapTool () |
| Creates new uninitialized overlap tool.
|
|
| BRepExtrema_OverlapTool (const Handle< BRepExtrema_TriangleSet > &theSet1, const Handle< BRepExtrema_TriangleSet > &theSet2) |
| Creates new overlap tool for the given element sets.
|
|
void | LoadTriangleSets (const Handle< BRepExtrema_TriangleSet > &theSet1, const Handle< BRepExtrema_TriangleSet > &theSet2) |
| Loads the given element sets into the overlap tool.
|
|
void | Perform (const Standard_Real theTolerance=0.0) |
| Performs searching of overlapped mesh elements.
|
|
Standard_Boolean | IsDone () const |
| Is overlap test completed?
|
|
void | MarkDirty () |
| Marks test results as outdated.
|
|
const BRepExtrema_MapOfIntegerPackedMapOfInteger & | OverlapSubShapes1 () const |
| Returns set of overlapped sub-shapes of 1st shape (currently only faces are detected).
|
|
const BRepExtrema_MapOfIntegerPackedMapOfInteger & | OverlapSubShapes2 () const |
| Returns set of overlapped sub-shapes of 2nd shape (currently only faces are detected).
|
|
void | SetElementFilter (BRepExtrema_ElementFilter *theFilter) |
| Sets filtering tool for preliminary checking pairs of mesh elements.
|
|
| BVH_PairTraverse () |
| Constructor.
|
|
void | SetBVHSets (void *theBVHSet1, void *theBVHSet2) |
| Sets the BVH Sets containing the BVH trees.
|
|
virtual Standard_Boolean | RejectNode (const BVH_VecNt &theCornerMin1, const BVH_VecNt &theCornerMax1, const BVH_VecNt &theCornerMin2, const BVH_VecNt &theCornerMax2, Standard_Real &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.
|
|
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.
|
|
Standard_Integer | Select (const opencascade::handle< BVH_Tree< Standard_Real, Dimension > > &theBVH1, const opencascade::handle< BVH_Tree< Standard_Real, 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.
|
|
virtual Standard_Boolean | IsMetricBetter (const Standard_Real &, const Standard_Real &) const |
| Compares the two metrics and chooses the best one. Returns true if the first metric is better than the second, false otherwise.
|
|
virtual Standard_Boolean | RejectMetric (const Standard_Real &) const |
| Rejects the node by the metric.
|
|
virtual Standard_Boolean | Stop () const |
| Returns the flag controlling the tree descend. Returns true if the tree descend should be stopped.
|
|
Enables storing of individual overlapped triangles (useful for debug).
Tool class for for detection of overlapping of two BVH primitive sets. This tool is not intended to be used independently, and is integrated in other classes, implementing algorithms based on shape tessellation (BRepExtrema_ShapeProximity and BRepExtrema_SelfIntersection).
Note that input element sets may correspond to different shapes or to the same shape. In first case, tessellations of two given shapes will be tested for intersection (or overlapping, if tolerance is not zero). In second case, tessellation of single shape will be tested for self- intersections. Please note that algorithm results are approximate and depend greatly on the quality of input tessellation(s).