g2o
Toggle main menu visibility
Loading...
Searching...
No Matches
g2o
examples
g2o_hierarchical
backbone_tree_action.h
Go to the documentation of this file.
1
// g2o - General Graph Optimization
2
// Copyright (C) 2011 R. Kuemmerle, G. Grisetti, H. Strasdat, W. Burgard
3
// All rights reserved.
4
//
5
// Redistribution and use in source and binary forms, with or without
6
// modification, are permitted provided that the following conditions are
7
// met:
8
//
9
// * Redistributions of source code must retain the above copyright notice,
10
// this list of conditions and the following disclaimer.
11
// * Redistributions in binary form must reproduce the above copyright
12
// notice, this list of conditions and the following disclaimer in the
13
// documentation and/or other materials provided with the distribution.
14
//
15
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
16
// IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
17
// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
18
// PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
19
// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
20
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
21
// TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
22
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
23
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
24
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26
27
#ifndef G2O_BACKBONE_TREE_ACTION_
28
#define G2O_BACKBONE_TREE_ACTION_
29
30
#include <map>
31
#include <string>
32
33
#include "
g2o/core/factory.h
"
34
#include "
g2o/core/hyper_dijkstra.h
"
35
#include "
g2o/core/sparse_optimizer.h
"
36
#include "
star.h
"
37
38
namespace
g2o
{
39
47
struct
BackBoneTreeAction
:
public
HyperDijkstra::TreeAction
{
55
BackBoneTreeAction
(
SparseOptimizer
* optimizer,
const
std::string& vertexTag,
56
int
level,
int
step
);
57
59
void
init
();
60
62
inline
VertexStarMap
&
vertexStarMap
() {
return
_vsMap
; }
64
inline
VertexStarMultimap
&
vertexStarMultiMap
() {
return
_vsMmap
; }
66
inline
HyperGraph::EdgeSet
&
freeEdges
() {
return
_freeEdges
; }
67
77
virtual
double
perform
(
HyperGraph::Vertex
* v,
HyperGraph::Vertex
* vParent,
78
HyperGraph::Edge
* e,
double
distance);
79
80
protected
:
88
void
addToMap
(
Star
* s,
HyperGraph::Vertex
* v);
91
Star
*
getStar
(
HyperGraph::Vertex
* v);
92
94
bool
fillStar
(
Star
* s,
HyperGraph::Edge
* e_);
95
96
SparseOptimizer
*
_optimizer
;
97
std::string
_vertexTag
;
98
int
_level
;
99
int
_step
;
100
101
VertexStarMap
_vsMap
;
102
VertexStarMultimap
_vsMmap
;
103
HyperGraph::EdgeSet
_freeEdges
;
104
Factory
*
_factory
;
105
};
106
107
}
// namespace g2o
108
#endif
g2o::Factory
create vertices and edges based on TAGs in, for example, a file
Definition
factory.h:48
g2o::HyperGraph::Edge
Definition
hyper_graph.h:172
g2o::HyperGraph::Vertex
abstract Vertex, your types must derive from that one
Definition
hyper_graph.h:148
g2o::HyperGraph::EdgeSet
std::set< Edge * > EdgeSet
Definition
hyper_graph.h:141
g2o::SparseOptimizer
Definition
sparse_optimizer.h:42
factory.h
hyper_dijkstra.h
g2o
Definition
dl_wrapper.cpp:55
g2o::VertexStarMap
std::map< OptimizableGraph::Vertex *, Star * > VertexStarMap
Definition
star.h:99
g2o::VertexStarMultimap
std::multimap< OptimizableGraph::Vertex *, Star * > VertexStarMultimap
Definition
star.h:98
step
yylloc step()
sparse_optimizer.h
star.h
g2o::BackBoneTreeAction::freeEdges
HyperGraph::EdgeSet & freeEdges()
edges that are not yet assigned to any star
Definition
backbone_tree_action.h:66
g2o::BackBoneTreeAction::getStar
Star * getStar(HyperGraph::Vertex *v)
Definition
backbone_tree_action.cpp:92
g2o::BackBoneTreeAction::_vsMmap
VertexStarMultimap _vsMmap
Definition
backbone_tree_action.h:102
g2o::BackBoneTreeAction::_optimizer
SparseOptimizer * _optimizer
Definition
backbone_tree_action.h:96
g2o::BackBoneTreeAction::_vertexTag
std::string _vertexTag
Definition
backbone_tree_action.h:97
g2o::BackBoneTreeAction::vertexStarMap
VertexStarMap & vertexStarMap()
map vertex->star. Contains the most recent vertex assignment
Definition
backbone_tree_action.h:62
g2o::BackBoneTreeAction::_factory
Factory * _factory
Definition
backbone_tree_action.h:104
g2o::BackBoneTreeAction::BackBoneTreeAction
BackBoneTreeAction(SparseOptimizer *optimizer, const std::string &vertexTag, int level, int step)
Definition
backbone_tree_action.cpp:37
g2o::BackBoneTreeAction::perform
virtual double perform(HyperGraph::Vertex *v, HyperGraph::Vertex *vParent, HyperGraph::Edge *e, double distance)
Definition
backbone_tree_action.cpp:58
g2o::BackBoneTreeAction::vertexStarMultiMap
VertexStarMultimap & vertexStarMultiMap()
multimap vertex->star. Contains all the vertex assignments to all stars
Definition
backbone_tree_action.h:64
g2o::BackBoneTreeAction::_vsMap
VertexStarMap _vsMap
Definition
backbone_tree_action.h:101
g2o::BackBoneTreeAction::_level
int _level
Definition
backbone_tree_action.h:98
g2o::BackBoneTreeAction::fillStar
bool fillStar(Star *s, HyperGraph::Edge *e_)
helper function that adds to a star an edge and all its vertices
Definition
backbone_tree_action.cpp:99
g2o::BackBoneTreeAction::addToMap
void addToMap(Star *s, HyperGraph::Vertex *v)
Definition
backbone_tree_action.cpp:81
g2o::BackBoneTreeAction::init
void init()
initializes the visit and clears the internal structures
Definition
backbone_tree_action.cpp:45
g2o::BackBoneTreeAction::_freeEdges
HyperGraph::EdgeSet _freeEdges
Definition
backbone_tree_action.h:103
g2o::BackBoneTreeAction::_step
int _step
Definition
backbone_tree_action.h:99
g2o::HyperDijkstra::TreeAction
Definition
hyper_dijkstra.h:45
g2o::Star
Definition
star.h:54
Generated on
for g2o by
1.17.0