kp | |
kptree | |
Mht | |
Assignments | |
Cluster | Hypotheses cluster class |
Color | Color class, extension to std_msgs::ColorRGBA |
constant_velocity_ekfilter | Constant velocity Kalman filter |
constantVelocityEKFilter | Constant velocity Kalman filter |
Conversion | |
GNN | |
GVGraph | An object containing a libgraph graph and its associated nodes and edges.
|
Hypothesis | Hypotheses tree nodes |
HypothesisTree | Hypotheses tree |
Markers | Dynamic markers support class |
Matrix | |
Measurement | Measurement class type |
Mht | Big and complicated class that implements the MHT (Multiple Hypotheses Tracking) algorithm |
MotionModel | Nonholonomic Motion model abstraction layer |
Munkres | |
Node | |
nonholonomicEKFilter | Nonholonomic Kalman filter |
orderedPair | |
Point | Simple point class |
PointCloudGeneretor | |
SearchArea | Ellipsoid target gait area |
st_cluster | This structure contains all point cluster information |
st_line | This structure contains a single line properties |
st_object | This structure contains object information |
t_classification | Object classification in regard to velocity and occlusion |
t_cluster | Cluster type class, clusters are groups of points in close proximity |
t_config | This structure contains global configurations parameters |
t_data | This structure has all points coordinates |
t_errors | Estimation errors |
t_flag | This structure contains global flags parameters |
t_fps | Iterations per second structure |
t_linked_list | Full description of and tracked object |
t_measurements | Single XY measurement |
t_motion_models | Motion models structure |
t_node | Class handler for tree nodes |
t_object_morphology | Morphologic information of target |
t_path | List of XY points |
t_point | Polar point structure |
t_position | Position structure, estimated and predicted values |
t_search_area | Ellipsoid target gait area |
t_timers | Timers structure |
t_velocity | Target velocity data |
Target | |
Timer | |
tree | |
breadth_first_queued_iterator | Breadth-first iterator, using a queue |
children_iterator | Iterator which traverses only the nodes which are siblings of each other |
compare_nodes | Comparator class for two nodes of a tree (used for sorting and searching) |
fixed_depth_iterator | Iterator which traverses only the nodes at a given depth from the root |
iterator_base | Base class for iterators, only pointers stored, no traversal logic |
iterator_base_less | Comparator class for iterators (compares pointer values; why doesn't this work automatically?) |
leaf_iterator | Iterator which traverses only the leaves |
post_order_iterator | Depth-first iterator, first accessing the children, then the node itself |
pre_order_iterator | Depth-first iterator, first accessing the node, then its children |
sibling_iterator | Iterator which traverses only the nodes which are siblings of each other |
tree_node_ | A node in the tree, combining links to other nodes as well as the actual data |