Tree node

* \brief Abstract interface for allocating HyperGraphElement */

* \brief base for allocating an optimization algorithm * * Allocating a solver for a given optimizer. The method construct() has to be * impl

* \brief Abstract interface for allocating a robust kernel */

forward declaration

* \brief base for the block solvers with some basic function interfaces */

command line parser

command line parser

/

* \brief 7D edge between two Vertex7 */

/

* \brief propagation of an initial guess */

* \brief cost for traversing along active edges in the optimizer * * You may derive an own one, if necessary. The default is to return initialEs

* \brief cost for traversing only odometry edges. * * Initialize your graph along odometry edges. An odometry edge is assumed to connect vertice

* \brief create vertices and edges based on TAGs in, for example, a file */

* \brief statistics about the optimization */

Class that models a directed Hyper-Graph. An hyper graph is a graph where an edge can connect one or more nodes. Both Vertices and Edges of an h

* \brief Abstract action that operates on an entire graph */

* \brief library of actions, indexed by the action name; * * library of actions, indexed by the action name; * one can use ti to register a c

* \brief Abstract action that operates on a graph entity */

* \brief collection of actions * * collection of actions calls contains homogeneous actions operating on different types * all collected acti

THIS IS THE INITIALIZER FOR MONOCULAR SLAM. NOT USED IN THE STEREO OR RGBD CASE.