Traversal node for distance computation between two meshes. More...
#include <mesh_distance_traversal_node.h>
Public Types | |
| using | S = typename BV::S |
 Public Types inherited from fcl::detail::BVHDistanceTraversalNode< BV > | |
| using | S = typename BV::S |
Public Member Functions | |
| bool | canStop (S c) const |
| Whether the traversal process can stop early. More... | |
| void | leafTesting (int b1, int b2) const |
| Distance testing between leaves (two triangles) More... | |
| MeshDistanceTraversalNode () | |
| Public Member Functions inherited from fcl::detail::BVHDistanceTraversalNode< BV > | |
| BVHDistanceTraversalNode () | |
| S | BVTesting (int b1, int b2) const |
| BV culling test in one BVTT node. More... | |
| bool | firstOverSecond (int b1, int b2) const |
| Determine the traversal order, is the first BVTT subtree better. More... | |
| int | getFirstLeftChild (int b) const |
| Obtain the left child of BV node in the first BVH. More... | |
| int | getFirstRightChild (int b) const |
| Obtain the right child of BV node in the first BVH. More... | |
| int | getSecondLeftChild (int b) const |
| Obtain the left child of BV node in the second BVH. More... | |
| int | getSecondRightChild (int b) const |
| Obtain the right child of BV node in the second BVH. More... | |
| bool | isFirstNodeLeaf (int b) const |
| Whether the BV node in the first BVH tree is leaf. More... | |
| bool | isSecondNodeLeaf (int b) const |
| Whether the BV node in the second BVH tree is leaf. More... | |
| Public Member Functions inherited from fcl::detail::DistanceTraversalNodeBase< BV::S > | |
| virtual bool | canStop (BV::S c) const |
| Check whether the traversal can stop. More... | |
| DistanceTraversalNodeBase () | |
| void | enableStatistics (bool enable) |
| Whether store some statistics information during traversal. More... | |
| virtual | ~DistanceTraversalNodeBase () |
| Public Member Functions inherited from fcl::detail::TraversalNodeBase< BV::S > | |
| virtual void | postprocess () |
| virtual void | preprocess () |
| virtual | ~TraversalNodeBase () |
Public Attributes | |
| S | abs_err |
| S | rel_err |
| relative and absolute error, default value is 0.01 for both terms More... | |
| Triangle * | tri_indices1 |
| Triangle * | tri_indices2 |
| Vector3< S > * | vertices1 |
| Vector3< S > * | vertices2 |
| Public Attributes inherited from fcl::detail::BVHDistanceTraversalNode< BV > | |
| const BVHModel< BV > * | model1 |
| The first BVH model. More... | |
| const BVHModel< BV > * | model2 |
| The second BVH model. More... | |
| int | num_bv_tests |
| statistical information More... | |
| int | num_leaf_tests |
| S | query_time_seconds |
| Public Attributes inherited from fcl::detail::DistanceTraversalNodeBase< BV::S > | |
| bool | enable_statistics |
| Whether stores statistics. More... | |
| DistanceRequest< BV::S > | request |
| request setting for distance More... | |
| DistanceResult< BV::S > * | result |
| distance result kept during the traversal iteration More... | |
| Public Attributes inherited from fcl::detail::TraversalNodeBase< BV::S > | |
| Transform3< BV::S > | tf1 |
| configuation of first object More... | |
| Transform3< BV::S > | tf2 |
| configuration of second object More... | |
Detailed Description
template<typename BV>
class fcl::detail::MeshDistanceTraversalNode< BV >
Traversal node for distance computation between two meshes.
Definition at line 55 of file mesh_distance_traversal_node.h.
Member Typedef Documentation
◆ S
| using fcl::detail::MeshDistanceTraversalNode< BV >::S = typename BV::S |
Definition at line 59 of file mesh_distance_traversal_node.h.
Constructor & Destructor Documentation
◆ MeshDistanceTraversalNode()
| fcl::detail::MeshDistanceTraversalNode< BV >::MeshDistanceTraversalNode |
Definition at line 96 of file mesh_distance_traversal_node-inl.h.
Member Function Documentation
◆ canStop()
| bool fcl::detail::MeshDistanceTraversalNode< BV >::canStop | ( | S | c | ) | const |
Whether the traversal process can stop early.
Definition at line 148 of file mesh_distance_traversal_node-inl.h.
◆ leafTesting()
|
virtual |
Distance testing between leaves (two triangles)
Reimplemented from fcl::detail::DistanceTraversalNodeBase< BV::S >.
Definition at line 109 of file mesh_distance_traversal_node-inl.h.
Member Data Documentation
◆ abs_err
| S fcl::detail::MeshDistanceTraversalNode< BV >::abs_err |
Definition at line 77 of file mesh_distance_traversal_node.h.
◆ rel_err
| S fcl::detail::MeshDistanceTraversalNode< BV >::rel_err |
relative and absolute error, default value is 0.01 for both terms
Definition at line 76 of file mesh_distance_traversal_node.h.
◆ tri_indices1
| Triangle* fcl::detail::MeshDistanceTraversalNode< BV >::tri_indices1 |
Definition at line 72 of file mesh_distance_traversal_node.h.
◆ tri_indices2
| Triangle* fcl::detail::MeshDistanceTraversalNode< BV >::tri_indices2 |
Definition at line 73 of file mesh_distance_traversal_node.h.
◆ vertices1
| Vector3<S>* fcl::detail::MeshDistanceTraversalNode< BV >::vertices1 |
Definition at line 69 of file mesh_distance_traversal_node.h.
◆ vertices2
| Vector3<S>* fcl::detail::MeshDistanceTraversalNode< BV >::vertices2 |
Definition at line 70 of file mesh_distance_traversal_node.h.
The documentation for this class was generated from the following files: