moving function up
parent
11db29b1d8
commit
61aed0e5ad
|
|
@ -99,6 +99,20 @@ double computeThetaToRoot(const Key nodeKey, PredecessorMap<Key>& tree,
|
||||||
return nodeTheta;
|
return nodeTheta;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This function computes the cumulative orientation (without wrapping)
|
||||||
|
* from each node to the root (root has zero orientation)
|
||||||
|
*/
|
||||||
|
map<Key, double> computeThetasToRoot(vector<Key>& keysInBinary, map<Key, double>& deltaThetaMap, PredecessorMap<Key>& tree){
|
||||||
|
|
||||||
|
map<Key, double> thetaToRootMap;
|
||||||
|
BOOST_FOREACH(const Key& nodeKey, keysInBinary){
|
||||||
|
double nodeTheta = computeThetaToRoot(nodeKey, tree, deltaThetaMap, thetaToRootMap);
|
||||||
|
thetaToRootMap.insert(std::pair<Key, double>(nodeKey, nodeTheta));
|
||||||
|
}
|
||||||
|
return thetaToRootMap;
|
||||||
|
}
|
||||||
|
|
||||||
void getSymbolicSubgraph(vector<Key>& keysInBinary, vector<size_t>& spanningTree,
|
void getSymbolicSubgraph(vector<Key>& keysInBinary, vector<size_t>& spanningTree,
|
||||||
vector<size_t>& chords, map<Key, double>& deltaThetaMap, PredecessorMap<Key>& tree, const NonlinearFactorGraph& g){
|
vector<size_t>& chords, map<Key, double>& deltaThetaMap, PredecessorMap<Key>& tree, const NonlinearFactorGraph& g){
|
||||||
// Get keys for which you want the orientation
|
// Get keys for which you want the orientation
|
||||||
|
|
@ -138,20 +152,6 @@ void getSymbolicSubgraph(vector<Key>& keysInBinary, vector<size_t>& spanningTree
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
|
||||||
* This function computes the cumulative orientation (without wrapping)
|
|
||||||
* from each node to the root (root has zero orientation)
|
|
||||||
*/
|
|
||||||
map<Key, double> computeThetasToRoot(vector<Key>& keysInBinary, map<Key, double>& deltaThetaMap, PredecessorMap<Key>& tree){
|
|
||||||
|
|
||||||
map<Key, double> thetaToRootMap;
|
|
||||||
BOOST_FOREACH(const Key& nodeKey, keysInBinary){
|
|
||||||
double nodeTheta = computeThetaToRoot(nodeKey, tree, deltaThetaMap, thetaToRootMap);
|
|
||||||
thetaToRootMap.insert(std::pair<Key, double>(nodeKey, nodeTheta));
|
|
||||||
}
|
|
||||||
return thetaToRootMap;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Linear factor graph with regularized orientation measurements
|
* Linear factor graph with regularized orientation measurements
|
||||||
*/
|
*/
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue