Navigation
API > API/Plugins > API/Plugins/PoseSearch
Vantage-point tree implementation https://en.wikipedia.org/wiki/Vantage-point_tree it relies on templated methods to specify the
- data point type (typename T, usually a multidimensional point like TArray
) - data source struct (typename TDataSource) that needs to implement struct FDataSource { const T& operatorint32 Index const; int32 Num() const; static float GetDistance(const T& A, const T& B); }; and can be specialized for runtime calls at FindNeighbors to laverage vectorized code with aliged and padded data
- the result set struct (typename TVPTreeResultSet), see struct FVPTreeResultSet below as example
| Name | UE::PoseSearch::ELabelFormat |
| Type | enum |
| Header File | /Engine/Plugins/Animation/PoseSearch/Source/Runtime/Public/PoseSearch/PoseSearchFeatureChannel.h |
| Include Path | #include "PoseSearch/PoseSearchFeatureChannel.h" |
Syntax
namespace UE
{
namespace PoseSearch
{
enum ELabelFormat
{
Full_Horizontal,
Full_Vertical,
Compact_Horizontal,
}
}
}
Values
| Name | Remarks |
|---|---|
| Full_Horizontal | Output label example: "Traj_Vel_xy 1.20" |
| Full_Vertical | Output label example: "Traj\nVel_xy\n1.20" |
| Compact_Horizontal | Output label example: "Vel_xy 1.20" |