Main MRPT website > C++ reference for MRPT 1.9.9
List of all members | Classes | Public Types | Public Member Functions | Public Attributes | Static Private Member Functions | Private Attributes
mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS > Class Template Reference

Detailed Description

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
class mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >

A directed graph of pose constraints, with edges being the relative poses between pairs of nodes identified by their numeric IDs (of type mrpt::utils::TNodeID).

A link or edge between two nodes "i" and "j", that is, the pose $ p_{ij} *$, holds the relative position of "j" with respect to "i". These poses are stored in the edges in the format specified by the template argument CPOSE. Users should employ the following derived classes depending on the desired representation of edges:

Two main members store all the information in this class:

Graphs can be loaded and saved to text file in the format used by TORO & HoG-man (more on the format here), using loadFromTextFile and saveToTextFile.

This class is the base for representing networks of poses, which are the main data type of a series of SLAM algorithms implemented in the library mrpt-slam, in the namespace mrpt::graphslam.

The template arguments are:

See Also
mrpt::graphslam

Definition at line 119 of file CNetworkOfPoses.h.

#include <mrpt/graphs/CNetworkOfPoses.h>

Inheritance diagram for mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >:
Inheritance graph

Classes

struct  global_pose_t
 The type of each global pose in nodes: an extension of the constraint_no_pdf_t pose with any optional user-defined data. More...
 

Public Types

typedef
mrpt::aligned_containers
< TPairNodeIDs, edge_t >
::multimap_t 
edges_map_t
 The type of the member edges. More...
 
typedef edges_map_t::iterator iterator
 
typedef
edges_map_t::reverse_iterator 
reverse_iterator
 
typedef edges_map_t::const_iterator const_iterator
 
typedef
edges_map_t::const_reverse_iterator 
const_reverse_iterator
 
Typedef's
typedef
mrpt::graphs::CDirectedGraph
< CPOSE, EDGE_ANNOTATIONS > 
BASE
 The base class "CDirectedGraph<CPOSE,EDGE_ANNOTATIONS>". More...
 
typedef CNetworkOfPoses< CPOSE,
MAPS_IMPLEMENTATION,
NODE_ANNOTATIONS,
EDGE_ANNOTATIONS > 
self_t
 My own type. More...
 
typedef CPOSE constraint_t
 The type of PDF poses in the contraints (edges) (=CPOSE template argument) More...
 
typedef NODE_ANNOTATIONS node_annotations_t
 The extra annotations in nodes, apart from a constraint_no_pdf_t. More...
 
typedef EDGE_ANNOTATIONS edge_annotations_t
 The extra annotations in edges, apart from a constraint_t. More...
 
typedef MAPS_IMPLEMENTATION maps_implementation_t
 The type of map's implementation (=MAPS_IMPLEMENTATION template argument) More...
 
typedef CPOSE::type_value constraint_no_pdf_t
 The type of edges or their means if they are PDFs (that is, a simple "edge" value) More...
 
typedef
MAPS_IMPLEMENTATION::template
map< mrpt::utils::TNodeID,
CPOSE > 
global_poses_pdf_t
 A map from pose IDs to their global coordinate estimates, with uncertainty. More...
 
typedef
MAPS_IMPLEMENTATION::template
map< mrpt::utils::TNodeID,
global_pose_t
global_poses_t
 A map from pose IDs to their global coordinate estimates, without uncertainty (the "most-likely value") More...
 

Public Member Functions

iterator begin ()
 
const_iterator begin () const
 
iterator rbegin ()
 
const_iterator rbegin () const
 
iterator end ()
 
const_iterator end () const
 
iterator rend ()
 
const_iterator rend () const
 
I/O file methods
void saveToTextFile (const std::string &fileName) const
 Saves to a text file in the format used by TORO & HoG-man (more on the format <a href="http://www.mrpt.org/Robotics_file_formats" * >here) For 2D graphs only VERTEX2 & EDGE2 entries will be saved, and VERTEX3 & EDGE3 entries for 3D graphs. More...
 
void loadFromTextFile (const std::string &fileName, bool collapse_dup_edges=true)
 Loads from a text file in the format used by TORO & HoG-man (more on the format here) Recognized line entries are: VERTEX2, VERTEX3, EDGE2, EDGE3, EQUIV. More...
 
Ctors & Dtors
 CNetworkOfPoses ()
 Default constructor (just sets root to "0" and edges_store_inverse_poses to "false") More...
 
 ~CNetworkOfPoses ()
 
Edges/nodes utility methods
size_t edgeCount () const
 The number of edges in the graph. More...
 
void clearEdges ()
 Erase all edges. More...
 
void insertEdge (TNodeID from_nodeID, TNodeID to_nodeID, const edge_t &edge_value)
 Insert an edge (from -> to) with the given edge value. More...
 
void insertEdgeAtEnd (TNodeID from_nodeID, TNodeID to_nodeID, const edge_t &edge_value)
 Insert an edge (from -> to) with the given edge value (more efficient version to be called if you know that the end will go at the end of the sorted std::multimap). More...
 
bool edgeExists (TNodeID from_nodeID, TNodeID to_nodeID) const
 Test if the given directed edge exists. More...
 
edge_t & getEdge (TNodeID from_nodeID, TNodeID to_nodeID)
 Return a reference to the content of a given edge. More...
 
const edge_t & getEdge (TNodeID from_nodeID, TNodeID to_nodeID) const
 Return a reference to the content of a given edge. More...
 
std::pair< iterator, iteratorgetEdges (TNodeID from_nodeID, TNodeID to_nodeID)
 Return a pair<first,last> of iterators to the range of edges between two given nodes. More...
 
std::pair< const_iterator,
const_iterator
getEdges (TNodeID from_nodeID, TNodeID to_nodeID) const
 Return a pair<first,last> of const iterators to the range of edges between two given nodes. More...
 
void eraseEdge (TNodeID from_nodeID, TNodeID to_nodeID)
 Erase all edges between the given nodes (it has no effect if no edge existed) More...
 
void getAllNodes (std::set< TNodeID > &lstNode_IDs) const
 Return a list of all the node_ID's of the graph, generated from all the nodes that appear in the list of edges. More...
 
std::set< TNodeID > getAllNodes () const
 Less efficient way to get all nodes that returns a copy of the set object. More...
 
size_t countDifferentNodesInEdges () const
 Count how many different node IDs appear in the graph edges. More...
 
void getNeighborsOf (const TNodeID nodeID, std::set< TNodeID > &neighborIDs) const
 Return the list of all neighbors of "nodeID", by creating a list of their node IDs. More...
 
std::set< TNodeID > getNeighborsOf (const TNodeID nodeID) const
 Return the list of all neighbors of "nodeID", by creating a list of their node IDs. More...
 
void getAdjacencyMatrix (MAP_NODEID_SET_NODEIDS &outAdjacency) const
 Return a map from node IDs to all its neighbors (that is, connected nodes, regardless of the edge direction) This is a much more efficient method than calling getNeighborsOf() for each node in the graph. More...
 
void getAdjacencyMatrix (MAP_NODEID_SET_NODEIDS &outAdjacency, const SET_NODEIDS &onlyForTheseNodes) const
 Just like getAdjacencyMatrix but return only the adjacency for those node_ids in the set onlyForTheseNodes (both endings nodes of an edge must be within the set for it to be returned) More...
 
I/O utilities
bool saveAsDot (std::ostream &o, const TGraphvizExportParams &p=TGraphvizExportParams()) const
 Save the graph in a Graphviz (.dot files) text format; useful for quickly rendering the graph with "dot". More...
 
bool saveAsDot (const std::string &fileName, const TGraphvizExportParams &p=TGraphvizExportParams()) const
 

Public Attributes

edges_map_t edges
 The public member with the directed edges in the graph. More...
 
Data members
global_poses_t nodes
 The nodes (vertices) of the graph, with their estimated "global" (with respect to root) position, without an associated covariance. More...
 
mrpt::utils::TNodeID root
 The ID of the node that is the origin of coordinates, used as reference by all coordinates in nodes. More...
 
bool edges_store_inverse_poses
 False (default) if an edge i->j stores the normal relative pose of j as seen from i: $ \Delta_i^j = j \ominus i $ True if an edge i->j stores the inverse relateive pose, that is, i as seen from j: $ \Delta_i^j = i \ominus j $. More...
 

Static Private Member Functions

static void addVirtualEdge (self_t *graph, const TNodeID &from, const TNodeID &to)
 Add a virtual edge between two nodes in the given graph. More...
 

Private Attributes

mrpt::graphs::detail::CVisualizer
< CPOSE, MAPS_IMPLEMENTATION,
NODE_ANNOTATIONS,
EDGE_ANNOTATIONS > * 
visualizer
 Pointer to the CVisualizer instance used to visualize the graph in the opengl window. More...
 

Utility methods

void getAs3DObject (mrpt::opengl::CSetOfObjects::Ptr object, const mrpt::utils::TParametersDouble &viz_params) const
 Return 3D Visual Representation of the edges and nodes in the network of poses. More...
 
void dijkstra_nodes_estimate ()
 Spanning tree computation of a simple estimation of the global coordinates of each node just from the information in all edges, sorted in a Dijkstra tree based on the current "root" node. More...
 
size_t collapseDuplicatedEdges ()
 Look for duplicated edges (even in opposite directions) between all pairs of nodes and fuse them. More...
 
double getGlobalSquareError (bool ignoreCovariances=true) const
 Computes the overall square error from all the pose constraints (edges) with respect to the global poses in nodes If ignoreCovariances is false, the squared Mahalanobis distance will be computed instead of the straight square error. More...
 
void extractSubGraph (const std::set< TNodeID > &node_IDs, self_t *sub_graph, const TNodeID root_node_in=INVALID_NODEID, const bool &auto_expand_set=true) const
 Find the edges between the nodes in the node_IDs set and fill given graph pointer accordingly. More...
 
void mergeGraph (const self_t &other, const typename std::vector< detail::THypothesis< self_t >> &common_hypots, const bool hypots_from_other_to_self=true, std::map< TNodeID, TNodeID > *old_to_new_nodeID_mappings_out=NULL)
 Integrate given graph into own graph using the list of provided common THypotheses. More...
 
double getEdgeSquareError (const typename BASE::edges_map_t::const_iterator &itEdge, bool ignoreCovariances=true) const
 Computes the square error of one pose constraints (edge) with respect to the global poses in nodes If ignoreCovariances is false, the squared Mahalanobis distance will be computed instead of the straight square error. More...
 
double getEdgeSquareError (const mrpt::utils::TNodeID from_id, const mrpt::utils::TNodeID to_id, bool ignoreCovariances=true) const
 Computes the square error of one pose constraints (edge) with respect to the global poses in nodes If ignoreCovariances is false, the squared Mahalanobis distance will be computed instead of the straight square error. More...
 
void clear ()
 Empty all edges, nodes and set root to ID 0. More...
 
size_t nodeCount () const
 Return number of nodes in the list nodes of global coordinates (may be different that all nodes appearing in edges) More...
 
static void connectGraphPartitions (self_t *sub_graph, const std::set< TNodeID > &groupA, const std::set< TNodeID > &groupB)
 Add an edge between the last node of the group with the lower nodeIDs and the first node of the higher nodeIDs. More...
 

Member Typedef Documentation

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef mrpt::graphs::CDirectedGraph<CPOSE, EDGE_ANNOTATIONS> mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::BASE

The base class "CDirectedGraph<CPOSE,EDGE_ANNOTATIONS>".

Definition at line 126 of file CNetworkOfPoses.h.

typedef edges_map_t::const_iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::const_iterator
inherited

Definition at line 94 of file CDirectedGraph.h.

typedef edges_map_t::const_reverse_iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::const_reverse_iterator
inherited

Definition at line 95 of file CDirectedGraph.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef CPOSE::type_value mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::constraint_no_pdf_t

The type of edges or their means if they are PDFs (that is, a simple "edge" value)

Definition at line 145 of file CNetworkOfPoses.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef CPOSE mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::constraint_t

The type of PDF poses in the contraints (edges) (=CPOSE template argument)

Definition at line 134 of file CNetworkOfPoses.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef EDGE_ANNOTATIONS mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::edge_annotations_t

The extra annotations in edges, apart from a constraint_t.

Definition at line 138 of file CNetworkOfPoses.h.

typedef mrpt::aligned_containers<TPairNodeIDs, edge_t>::multimap_t mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::edges_map_t
inherited

The type of the member edges.

Definition at line 91 of file CDirectedGraph.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef MAPS_IMPLEMENTATION::template map<mrpt::utils::TNodeID, CPOSE> mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::global_poses_pdf_t

A map from pose IDs to their global coordinate estimates, with uncertainty.

Definition at line 206 of file CNetworkOfPoses.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef MAPS_IMPLEMENTATION::template map<mrpt::utils::TNodeID, global_pose_t> mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::global_poses_t

A map from pose IDs to their global coordinate estimates, without uncertainty (the "most-likely value")

Definition at line 212 of file CNetworkOfPoses.h.

typedef edges_map_t::iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::iterator
inherited

Definition at line 92 of file CDirectedGraph.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef MAPS_IMPLEMENTATION mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::maps_implementation_t

The type of map's implementation (=MAPS_IMPLEMENTATION template argument)

Definition at line 142 of file CNetworkOfPoses.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef NODE_ANNOTATIONS mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::node_annotations_t

The extra annotations in nodes, apart from a constraint_no_pdf_t.

Definition at line 136 of file CNetworkOfPoses.h.

typedef edges_map_t::reverse_iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::reverse_iterator
inherited

Definition at line 93 of file CDirectedGraph.h.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
typedef CNetworkOfPoses<CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS> mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::self_t

My own type.

Definition at line 130 of file CNetworkOfPoses.h.

Constructor & Destructor Documentation

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::CNetworkOfPoses ( )
inline

Default constructor (just sets root to "0" and edges_store_inverse_poses to "false")

Definition at line 908 of file CNetworkOfPoses.h.

References mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::visualizer.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::~CNetworkOfPoses ( )
inline

Definition at line 929 of file CNetworkOfPoses.h.

Member Function Documentation

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
static void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::addVirtualEdge ( self_t graph,
const TNodeID &  from,
const TNodeID &  to 
)
inlinestaticprivate
iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::begin ( )
inlineinherited
const_iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::begin ( ) const
inlineinherited
template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::clear ( void  )
inline
void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::clearEdges ( )
inlineinherited

Erase all edges.

Definition at line 120 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
size_t mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::collapseDuplicatedEdges ( )
inline

Look for duplicated edges (even in opposite directions) between all pairs of nodes and fuse them.

Upon return, only one edge remains between each pair of nodes with the mean & covariance (or information matrix) corresponding to the Bayesian fusion of all the Gaussians.

Returns
Overall number of removed edges.

Definition at line 326 of file CNetworkOfPoses.h.

References mrpt::graphs::detail::graph_ops< GRAPH_T >::graph_of_poses_collapse_dup_edges().

Referenced by mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::loadFromTextFile().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
static void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::connectGraphPartitions ( self_t sub_graph,
const std::set< TNodeID > &  groupA,
const std::set< TNodeID > &  groupB 
)
inlinestatic

Add an edge between the last node of the group with the lower nodeIDs and the first node of the higher nodeIDs.

Given groups of nodes should only contain consecutive nodeIDs and there should be no overlapping between them

Note
It is assumed that the sets of nodes are already in ascending order (default std::set behavior.

Definition at line 816 of file CNetworkOfPoses.h.

References mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::addVirtualEdge(), and ASSERTMSG_.

Referenced by mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::extractSubGraph().

size_t mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::countDifferentNodesInEdges ( ) const
inlineinherited

Count how many different node IDs appear in the graph edges.

Definition at line 233 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::dijkstra_nodes_estimate ( )
inline

Spanning tree computation of a simple estimation of the global coordinates of each node just from the information in all edges, sorted in a Dijkstra tree based on the current "root" node.

Note
The "global" coordinates are with respect to the node with the ID specified in root.
This method takes into account the value of edges_store_inverse_poses
See Also
node, root

Definition at line 314 of file CNetworkOfPoses.h.

References mrpt::graphs::detail::graph_ops< GRAPH_T >::graph_of_poses_dijkstra_init().

Referenced by mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::extractSubGraph(), and mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::mergeGraph().

size_t mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::edgeCount ( ) const
inlineinherited

The number of edges in the graph.

Definition at line 118 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

bool mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::edgeExists ( TNodeID  from_nodeID,
TNodeID  to_nodeID 
) const
inlineinherited

Test if the given directed edge exists.

Definition at line 143 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::end ( )
inlineinherited
const_iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::end ( ) const
inlineinherited
void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::eraseEdge ( TNodeID  from_nodeID,
TNodeID  to_nodeID 
)
inlineinherited

Erase all edges between the given nodes (it has no effect if no edge existed)

Definition at line 203 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::extractSubGraph ( const std::set< TNodeID > &  node_IDs,
self_t sub_graph,
const TNodeID  root_node_in = INVALID_NODEID,
const bool &  auto_expand_set = true 
) const
inline

Find the edges between the nodes in the node_IDs set and fill given graph pointer accordingly.

Parameters
[in]node_IDsSet of nodes, between which, edges should be found and inserted in the given sub_graph pointer
[in]root_node_inNode ID to be used as the root node of sub_graph. If this is not given, the lowest nodeID is to be used.
[out]CNetworkOfPosespointer that is to be filled.
[in]auto_expand_setIf true and in case the node_IDs set contains non-consecutive nodes the returned set is expanded with the in-between nodes. This makes sure that the final graph is always connected. If auto_expand_set is false but there exist non-consecutive nodes, virtual edges are inserted in the parts that the graph is not connected

Definition at line 369 of file CNetworkOfPoses.h.

References mrpt::math::absDiff(), mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::addVirtualEdge(), ASSERT_, ASSERTMSG_, mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS >::begin(), mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::clear(), mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::clearEdges(), mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::connectGraphPartitions(), mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::dijkstra_nodes_estimate(), mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS >::edges, mrpt::format(), mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::getNeighborsOf(), mrpt::graphs::detail::NotConnectedGraph::getUnconnectedNodeIDs(), mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::insertEdge(), INVALID_NODEID, mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::nodes, and mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::root.

void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getAdjacencyMatrix ( MAP_NODEID_SET_NODEIDS &  outAdjacency) const
inlineinherited

Return a map from node IDs to all its neighbors (that is, connected nodes, regardless of the edge direction) This is a much more efficient method than calling getNeighborsOf() for each node in the graph.

Possible values for the template argument MAP_NODEID_SET_NODEIDS are:

Definition at line 279 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getAdjacencyMatrix ( MAP_NODEID_SET_NODEIDS &  outAdjacency,
const SET_NODEIDS &  onlyForTheseNodes 
) const
inlineinherited

Just like getAdjacencyMatrix but return only the adjacency for those node_ids in the set onlyForTheseNodes (both endings nodes of an edge must be within the set for it to be returned)

Definition at line 295 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getAllNodes ( std::set< TNodeID > &  lstNode_IDs) const
inlineinherited

Return a list of all the node_ID's of the graph, generated from all the nodes that appear in the list of edges.

Definition at line 211 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

std::set<TNodeID> mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getAllNodes ( ) const
inlineinherited

Less efficient way to get all nodes that returns a copy of the set object.

See Also
getAllNodes( std::set<TNodeID> &lstNode_IDs)

Definition at line 224 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::getAllNodes().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::getAs3DObject ( mrpt::opengl::CSetOfObjects::Ptr  object,
const mrpt::utils::TParametersDouble viz_params 
) const
inline

Return 3D Visual Representation of the edges and nodes in the network of poses.

Method makes the call to the corresponding method of the CVisualizer class instance.

Definition at line 295 of file CNetworkOfPoses.h.

References mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::visualizer.

edge_t& mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getEdge ( TNodeID  from_nodeID,
TNodeID  to_nodeID 
)
inlineinherited

Return a reference to the content of a given edge.

If several edges exist between the given nodes, the first one is returned.

Exceptions
std::exceptionif the given edge does not exist
See Also
getEdges

Definition at line 155 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges, mrpt::format(), and THROW_EXCEPTION.

const edge_t& mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getEdge ( TNodeID  from_nodeID,
TNodeID  to_nodeID 
) const
inlineinherited

Return a reference to the content of a given edge.

If several edges exist between the given nodes, the first one is returned.

Exceptions
std::exceptionif the given edge does not exist
See Also
getEdges

Definition at line 173 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges, mrpt::format(), and THROW_EXCEPTION.

std::pair<iterator, iterator> mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getEdges ( TNodeID  from_nodeID,
TNodeID  to_nodeID 
)
inlineinherited

Return a pair<first,last> of iterators to the range of edges between two given nodes.

See Also
getEdge

Definition at line 187 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

std::pair<const_iterator, const_iterator> mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getEdges ( TNodeID  from_nodeID,
TNodeID  to_nodeID 
) const
inlineinherited

Return a pair<first,last> of const iterators to the range of edges between two given nodes.

See Also
getEdge

Definition at line 194 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
double mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::getEdgeSquareError ( const typename BASE::edges_map_t::const_iterator itEdge,
bool  ignoreCovariances = true 
) const
inline

Computes the square error of one pose constraints (edge) with respect to the global poses in nodes If ignoreCovariances is false, the squared Mahalanobis distance will be computed instead of the straight square error.

Exceptions
std::exceptionOn global poses not in nodes

Definition at line 855 of file CNetworkOfPoses.h.

References mrpt::graphs::detail::graph_ops< GRAPH_T >::graph_edge_sqerror().

Referenced by mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::getEdgeSquareError().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
double mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::getEdgeSquareError ( const mrpt::utils::TNodeID  from_id,
const mrpt::utils::TNodeID  to_id,
bool  ignoreCovariances = true 
) const
inline

Computes the square error of one pose constraints (edge) with respect to the global poses in nodes If ignoreCovariances is false, the squared Mahalanobis distance will be computed instead of the straight square error.

Exceptions
std::exceptionOn edge not existing or global poses not in nodes

Definition at line 871 of file CNetworkOfPoses.h.

References ASSERTMSG_, mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS >::edges, mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS >::end(), mrpt::format(), and mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::getEdgeSquareError().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
double mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::getGlobalSquareError ( bool  ignoreCovariances = true) const
inline

Computes the overall square error from all the pose constraints (edges) with respect to the global poses in nodes If ignoreCovariances is false, the squared Mahalanobis distance will be computed instead of the straight square error.

See Also
getEdgeSquareError
Exceptions
std::exceptionOn global poses not in nodes

Definition at line 339 of file CNetworkOfPoses.h.

References mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS >::begin(), and mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS >::edges.

void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getNeighborsOf ( const TNodeID  nodeID,
std::set< TNodeID > &  neighborIDs 
) const
inlineinherited

Return the list of all neighbors of "nodeID", by creating a list of their node IDs.

See Also
getAdjacencyMatrix

Definition at line 247 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges.

std::set<TNodeID> mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::getNeighborsOf ( const TNodeID  nodeID) const
inlineinherited

Return the list of all neighbors of "nodeID", by creating a list of their node IDs.

See Also
getAdjacencyMatrix

Definition at line 262 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::getNeighborsOf().

void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::insertEdge ( TNodeID  from_nodeID,
TNodeID  to_nodeID,
const edge_t &  edge_value 
)
inlineinherited
void mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::insertEdgeAtEnd ( TNodeID  from_nodeID,
TNodeID  to_nodeID,
const edge_t &  edge_value 
)
inlineinherited

Insert an edge (from -> to) with the given edge value (more efficient version to be called if you know that the end will go at the end of the sorted std::multimap).

See Also
insertEdge

Definition at line 134 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::edges, and MRPT_ALIGN16.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::loadFromTextFile ( const std::string &  fileName,
bool  collapse_dup_edges = true 
)
inline

Loads from a text file in the format used by TORO & HoG-man (more on the format here) Recognized line entries are: VERTEX2, VERTEX3, EDGE2, EDGE3, EQUIV.

If an unknown entry is found, a warning is dumped to std::cerr (only once for each unknown keyword). An exception will be raised if trying to load a 3D graph into a 2D class (in the opposite case, missing 3D data will default to zero).

Parameters
[in]fileNameThe file to load.
[in]collapse_dup_edgesIf true, collapseDuplicatedEdges will be called automatically after loading (note that this operation may take significant time for very large graphs).
See Also
loadFromBinaryFile, saveToTextFile
Exceptions
Onany error, as a malformed line or loading a 3D graph in a 2D graph.

Definition at line 277 of file CNetworkOfPoses.h.

References mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::collapseDuplicatedEdges(), and mrpt::graphs::detail::graph_ops< GRAPH_T >::load_graph_of_poses_from_text_file().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::mergeGraph ( const self_t other,
const typename std::vector< detail::THypothesis< self_t >> &  common_hypots,
const bool  hypots_from_other_to_self = true,
std::map< TNodeID, TNodeID > *  old_to_new_nodeID_mappings_out = NULL 
)
inline

Integrate given graph into own graph using the list of provided common THypotheses.

Nodes of the other graph are renumbered upon integration in own graph.

Parameters
[in]otherGraph (of the same type) that is to be integrated with own graph.
[in]Hypothesesthat join own and other graph.
[in]hypots_from_other_to_selfSpecify the direction of the THypothesis objects in the common_hypots. If true (default) they are directed from other to own graph (other own),
[out]old_to_new_nodeID_mappings_outMap from the old nodeIDs that are in the given graph to the new nodeIDs that have been inserted (by this method) in own graph.

Definition at line 678 of file CNetworkOfPoses.h.

References ASSERT_, ASSERTMSG_, mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::begin(), mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::dijkstra_nodes_estimate(), mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::end(), mrpt::format(), mrpt::graphs::CDirectedGraph< CPOSE, EDGE_ANNOTATIONS >::insertEdge(), MRPT_END, MRPT_START, and mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::nodes.

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
size_t mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::nodeCount ( ) const
inline

Return number of nodes in the list nodes of global coordinates (may be different that all nodes appearing in edges)

See Also
mrpt::graphs::CDirectedGraph::countDifferentNodesInEdges

Definition at line 900 of file CNetworkOfPoses.h.

References mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::nodes.

iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::rbegin ( )
inlineinherited
const_iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::rbegin ( ) const
inlineinherited
iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::rend ( )
inlineinherited
const_iterator mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::rend ( ) const
inlineinherited
bool mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::saveAsDot ( std::ostream &  o,
const TGraphvizExportParams p = TGraphvizExportParams() 
) const
inlineinherited

Save the graph in a Graphviz (.dot files) text format; useful for quickly rendering the graph with "dot".

Returns
false on any error

Definition at line 321 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::begin(), mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::end(), and mrpt::mrpt::format().

bool mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::saveAsDot ( const std::string &  fileName,
const TGraphvizExportParams p = TGraphvizExportParams() 
) const
inlineinherited

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Definition at line 365 of file CDirectedGraph.h.

References mrpt::graphs::CDirectedGraph< TYPE_EDGES, EDGE_ANNOTATIONS >::saveAsDot().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
void mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::saveToTextFile ( const std::string &  fileName) const
inline

Saves to a text file in the format used by TORO & HoG-man (more on the format <a href="http://www.mrpt.org/Robotics_file_formats" * >here) For 2D graphs only VERTEX2 & EDGE2 entries will be saved, and VERTEX3 & EDGE3 entries for 3D graphs.

Note that EQUIV entries will not be saved, but instead several EDGEs will be stored between the same node IDs.

See Also
saveToBinaryFile, loadFromTextFile
Exceptions
Onany error

Definition at line 253 of file CNetworkOfPoses.h.

References mrpt::graphs::detail::graph_ops< GRAPH_T >::save_graph_of_poses_to_text_file().

Member Data Documentation

edges_map_t mrpt::graphs::CDirectedGraph< CPOSE , EDGE_ANNOTATIONS >::edges
inherited
template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
bool mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::edges_store_inverse_poses

False (default) if an edge i->j stores the normal relative pose of j as seen from i: $ \Delta_i^j = j \ominus i $ True if an edge i->j stores the inverse relateive pose, that is, i as seen from j: $ \Delta_i^j = i \ominus j $.

Definition at line 235 of file CNetworkOfPoses.h.

Referenced by mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::clear().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
global_poses_t mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::nodes
template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
mrpt::utils::TNodeID mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::root

The ID of the node that is the origin of coordinates, used as reference by all coordinates in nodes.

By default, root is the ID "0".

Definition at line 228 of file CNetworkOfPoses.h.

Referenced by mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::clear(), and mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::extractSubGraph().

template<class CPOSE, class MAPS_IMPLEMENTATION = mrpt::utils::map_traits_stdmap, class NODE_ANNOTATIONS = mrpt::graphs::detail::TNodeAnnotationsEmpty, class EDGE_ANNOTATIONS = mrpt::graphs::detail::edge_annotations_empty>
mrpt::graphs::detail::CVisualizer<CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS>* mrpt::graphs::CNetworkOfPoses< CPOSE, MAPS_IMPLEMENTATION, NODE_ANNOTATIONS, EDGE_ANNOTATIONS >::visualizer
private



Page generated by Doxygen 1.8.6 for MRPT 1.9.9 Git: 1b87f42 Sat Aug 19 17:50:46 2017 +0200 at miƩ ago 23 18:30:11 CEST 2017