TTK
Loading...
Searching...
No Matches
ttk::KDTree< dataType, Container > Member List

This is the complete list of members for ttk::KDTree< dataType, Container >, including all inherited members.

build(dataType *data, const int &ptNumber, const int &dimension, const std::vector< std::vector< dataType > > &weights={}, const int &weightNumber=1, const int &nodeNumber=-1, const bool &preciseBoundingBox=false)ttk::KDTree< dataType, Container >
buildRecursive(dataType *data, std::vector< int > &idx_side, const int &ptNumber, const int &dimension, KDTree< dataType, Container > *parent, KDTreeMap &correspondence_map, const int &nodeNumber, const int &maximumLevel, int &createdNumberNode, const std::vector< std::vector< dataType > > &weights={}, const int &weightNumber=1)ttk::KDTree< dataType, Container >
coordinates_ttk::KDTree< dataType, Container >
coords_max_ttk::KDTree< dataType, Container >
coords_min_ttk::KDTree< dataType, Container >
coords_number_ttk::KDTree< dataType, Container >protected
distanceToBox(const KDTree< dataType, Container > &subtree, const Container &coordinates, const PowerFunc &power) constttk::KDTree< dataType, Container >inline
getCoordinates() constttk::KDTree< dataType, Container >inline
getCost(const Container &coordinates, const PowerFunc &power) constttk::KDTree< dataType, Container >inline
getKClosest(const unsigned int k, const Container &coordinates, KDTreeMap &neighbours, std::vector< dataType > &costs, const int weight_index=0)ttk::KDTree< dataType, Container >
getMinSubWeight(const int weight_index=0) constttk::KDTree< dataType, Container >inline
getWeight(const int weight_index=0) constttk::KDTree< dataType, Container >inline
id_ttk::KDTree< dataType, Container >
include_weights_ttk::KDTree< dataType, Container >protected
is_left_ttk::KDTree< dataType, Container >protected
isLeaf() constttk::KDTree< dataType, Container >inline
isRoot() constttk::KDTree< dataType, Container >inline
KDTree()=defaultttk::KDTree< dataType, Container >
KDTree(const bool include_weights, const int p)ttk::KDTree< dataType, Container >inline
KDTree(KDTree *const father, const int coords_number, const bool is_left)ttk::KDTree< dataType, Container >inline
KDTreeMap typedefttk::KDTree< dataType, Container >
KDTreeRoot typedefttk::KDTree< dataType, Container >
left_ttk::KDTree< dataType, Container >
level_ttk::KDTree< dataType, Container >
min_subweights_ttk::KDTree< dataType, Container >
p_ttk::KDTree< dataType, Container >protected
parent_ttk::KDTree< dataType, Container >
recursiveGetKClosest(const unsigned int k, const Container &coordinates, KDTreeMap &neighbours, std::vector< dataType > &costs, const int weight_index, const PowerFunc &power)ttk::KDTree< dataType, Container >
right_ttk::KDTree< dataType, Container >
updateMinSubweight(const int weight_index=0)ttk::KDTree< dataType, Container >
updateWeight(const dataType new_weight, const int weight_index=0)ttk::KDTree< dataType, Container >inline
weight_ttk::KDTree< dataType, Container >