Public Member Functions | Private Attributes | List of all members
aruco::HighlyReliableMarkers::BalancedBinaryTree Class Reference

#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
 

Detailed Description

Balanced Binary Tree for a marker dictionary

Definition at line 217 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 486 of file highlyreliablemarkers.cpp.

void aruco::HighlyReliableMarkers::BalancedBinaryTree::loadDictionary ( Dictionary D)

Create the tree for dictionary D

Definition at line 391 of file highlyreliablemarkers.cpp.

Member Data Documentation

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

Definition at line 234 of file highlyreliablemarkers.h.

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

Definition at line 231 of file highlyreliablemarkers.h.

unsigned int aruco::HighlyReliableMarkers::BalancedBinaryTree::_root
private

Definition at line 238 of file highlyreliablemarkers.h.


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


asr_aruco_marker_recognition
Author(s): Allgeyer Tobias, Meißner Pascal, Qattan Mohamad
autogenerated on Mon Jun 10 2019 12:40:22