#include <bounding_volume_tree.h>
Class Description:
- Bounding volume tree is the spatial container for fast collision detection. It is mainly used as the contact search algorithm.
- This class requires following components:
- -
REFERENCE:
- Yang & Laursen, A contact searching algorithm including bounding volume trees applied to finite sliding mortar formulations
- Klosowski et al, Efficient collision detection using bounding volume hierarchies of k-DOPs
◆ ConditionsContainerType
◆ BoundingVolumeTree()
Kratos::BoundingVolumeTree::BoundingVolumeTree |
( |
int |
type | ) |
|
|
inline |
◆ ~BoundingVolumeTree()
virtual Kratos::BoundingVolumeTree::~BoundingVolumeTree |
( |
| ) |
|
|
inlinevirtual |
◆ AddGeometryFromConditions()
◆ BuildTreeTopDown()
◆ CheckValidity()
bool Kratos::BoundingVolumeTree::CheckValidity |
( |
| ) |
const |
|
inline |
◆ GetBoundingVolume()
const kDOP& Kratos::BoundingVolumeTree::GetBoundingVolume |
( |
| ) |
const |
|
inline |
◆ GetFirstGeometryId()
std::size_t Kratos::BoundingVolumeTree::GetFirstGeometryId |
( |
| ) |
const |
|
inline |
◆ GetLeftTree()
◆ GetRightTree()
◆ IsLeaf()
bool Kratos::BoundingVolumeTree::IsLeaf |
( |
| ) |
const |
|
inline |
◆ KRATOS_CLASS_POINTER_DEFINITION()
◆ pGetLeftTree()
BoundingVolumeTree::Pointer Kratos::BoundingVolumeTree::pGetLeftTree |
( |
| ) |
const |
|
inline |
◆ pGetRightTree()
BoundingVolumeTree::Pointer Kratos::BoundingVolumeTree::pGetRightTree |
( |
| ) |
const |
|
inline |
◆ Print()
void Kratos::BoundingVolumeTree::Print |
( |
std::ostream & |
rOStream, |
|
|
unsigned int |
level |
|
) |
| const |
|
inline |
◆ UpdateTree() [1/2]
◆ UpdateTree() [2/2]
void Kratos::BoundingVolumeTree::UpdateTree |
( |
ModelPart & |
r_model_part | ) |
|
|
inline |
The documentation for this class was generated from the following file: