Public Member Functions | Private Attributes
aruco::HighlyReliableMarkers::BalancedBinaryTree Class Reference

#include <highlyreliablemarkers.h>

List of all members.

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

Detailed Description

Balanced Binary Tree for a marker dictionary

Definition at line 223 of file highlyreliablemarkers.h.


Member Function Documentation

bool aruco::HighlyReliableMarkers::BalancedBinaryTree::findId ( unsigned int  id,
unsigned int &  orgPos 
)

Search a id in the dictionary. Return true if found, false otherwise.

Definition at line 465 of file highlyreliablemarkers.cpp.

Create the tree for dictionary D

Definition at line 380 of file highlyreliablemarkers.cpp.


Member Data Documentation

std::vector< std::pair<int, int> > aruco::HighlyReliableMarkers::BalancedBinaryTree::_binaryTree [private]

Definition at line 242 of file highlyreliablemarkers.h.

std::vector< std::pair<unsigned int,unsigned int> > aruco::HighlyReliableMarkers::BalancedBinaryTree::_orderD [private]

Definition at line 239 of file highlyreliablemarkers.h.

Definition at line 246 of file highlyreliablemarkers.h.


The documentation for this class was generated from the following files:


ar_sys
Author(s): Hamdi Sahloul , Rafael Muñoz Salinas , Bence Magyar
autogenerated on Sun Oct 5 2014 22:12:49