Navigation
API > API/Runtime > API/Runtime/AIModule
References
| Module | AIModule |
| Header | /Engine/Source/Runtime/AIModule/Public/BVTree.h |
| Include | #include "BVTree.h" |
Syntax
template<typename InElementType, typename InAllocator>
struct TBVTree
Remarks
BVTree - Bounding Volumes Tree
A binary search tree where each node has a Bounding Volume which is either an element (leaf nodes) or a volume encompassing all of its children (non-leaf nodes).
It provides fast gathering of all bounding volumes overlapping a given FBox (see GetOverlapping).
Users are expected to provide an implementation of CalcElementBounds for ElementType: static FBox CalcElementBounds(const FElement& Element) const
Constructors
| Type | Name | Description | |
|---|---|---|---|
TBVTree () |
|||
Functions
| Type | Name | Description | |
|---|---|---|---|
| FBox | CalcElementBounds
(
const FElement& |
You have to supply this yourself | |
| FBox | CalcNodeBounds
(
const TArray< FElementBox >& ElementBBoxes, |
||
| void | |||
| void | |||
| void | Assumes Elements has been set up | ||
| const TArray< FBox, InAllocator > & | |||
| const TArray< FElement > & | GetElements () |
||
| TArray< FElement > & | GetElements () |
||
| int | GetLongestAxis
(
const FBox& NodeBounds |
||
| const TArray< int16, InAllocator > & | GetNodes () |
||
| void | GetOverlapping
(
const FBox& Box, |
||
| bool | IsEmpty () |
||
| void | RecreateTree
(
TArray< FElement >&& InElements |
||
| void | RecreateTree () |
Recreate the tree based on the current content of Elements. | |
| void | RecreateTree
(
const TArray< FElement >& InElements |
||
| void | Reset () |
||
| void | Subdivide
(
TArray< FElementBox >& ElementBBoxes, |
Classes
| Type | Name | Description | |
|---|---|---|---|
| FElementBox |
Typedefs
| Name | Description |
|---|---|
| FElement |