89 "Bad vertices specified");
95 bool estimatev1 =
true;
96 bool estimatev2 =
true;
98 for (std::set<HyperGraph::Vertex*>::iterator it = fixed.begin();
99 it != fixed.end(); ++it) {
100 if (v1->
id() == (*it)->id()) {
102 }
else if (v2->
id() == (*it)->id()) {
123 for (std::set<HyperGraph::Vertex*>::iterator it = fixed.begin();
124 it != fixed.end(); ++it) {
EIGEN_STRONG_INLINE const Measurement & measurement() const
accessor functions for the measurement represented by the edge
EIGEN_STRONG_INLINE const InformationType & information() const
information matrix of the constraint
Measurement _measurement
the measurement of the edge
base class to represent an edge connecting an arbitrary number of nodes
virtual void resize(size_t size)
const EstimateType & estimate() const
return the current estimate of the vertex
void setEstimate(const EstimateType &et)
set the estimate for the vertex also calls updateCache()
virtual void initialEstimate(const OptimizableGraph::VertexSet &, OptimizableGraph::Vertex *)
virtual bool setMeasurementFromState()
virtual bool write(std::ostream &os) const
write the vertex to a stream
virtual void computeError()
virtual bool read(std::istream &is)
read the vertex from a stream, i.e., the internal state of the vertex
virtual double initialEstimatePossible(const OptimizableGraph::VertexSet &, OptimizableGraph::Vertex *)
VertexContainer _vertices
int id() const
returns the id
std::set< Vertex * > VertexSet
A general case Vertex for optimization.
SE2 inverse() const
invert :-)
2D pose Vertex, (x,y,theta)