#include <highlyreliablemarkers.h>
Public Member Functions | |
bool | findId (unsigned int id, unsigned int &orgPos) |
void | loadDictionary (Dictionary *D) |
Private Attributes | |
std::vector< std::pair< int, int > > | _binaryTree |
std::vector< std::pair< unsigned int, unsigned int > > | _orderD |
unsigned int | _root |
Balanced Binary Tree for a marker dictionary
Definition at line 219 of file highlyreliablemarkers.h.
bool aruco::hrm::HighlyReliableMarkers::BalancedBinaryTree::findId | ( | unsigned int | id, |
unsigned int & | orgPos | ||
) |
Search a id in the dictionary. Return true if found, false otherwise.
Definition at line 486 of file highlyreliablemarkers.cpp.
void aruco::hrm::HighlyReliableMarkers::BalancedBinaryTree::loadDictionary | ( | Dictionary * | D | ) |
Create the tree for dictionary D
Definition at line 391 of file highlyreliablemarkers.cpp.
|
private |
Definition at line 236 of file highlyreliablemarkers.h.
|
private |
Definition at line 233 of file highlyreliablemarkers.h.
|
private |
Definition at line 240 of file highlyreliablemarkers.h.