Frank Dellaert
|
b88e15e694
|
Faster variant of DSFMap, if not as elegant.
|
2013-10-27 03:45:12 +00:00 |
|
Frank Dellaert
|
d1a62b0cc1
|
Killed other variants
|
2013-10-27 02:50:47 +00:00 |
|
Frank Dellaert
|
f4b7ab54b0
|
Several DSFMap variants
|
2013-10-27 02:18:42 +00:00 |
Andrew Melim
|
5e29bc5b67
|
Return set partitions from DFSMap
|
2013-10-26 22:22:31 +00:00 |
|
Frank Dellaert
|
14ab4f6355
|
Quadratic growth in nr images to be expected.
|
2013-10-26 20:21:10 +00:00 |
|
Frank Dellaert
|
b80859211c
|
Timing DSF variants: functional DSF is faster than in-place, but both way slower than DSFMap, which in turn is slower than DSFBase
|
2013-10-26 20:14:01 +00:00 |
|
Frank Dellaert
|
48dd3cb769
|
DSF with Map, allows more general types
|
2013-10-26 17:57:03 +00:00 |
|
Frank Dellaert
|
19966fe112
|
Added pairwise matching example
|
2013-10-26 16:08:18 +00:00 |
Chris Beall
|
4297d24c96
|
changed tabs to spaces for consistent indentation in all of GTSAM
|
2012-10-02 14:40:07 +00:00 |
Yong-Dian Jian
|
6c2f213091
|
1. use DSFVector for spanning tree in SubgraphSolver
2. move DSFVector from unstable to stable
3. create Dummy.cpp to prevent base_unstable degenerate
|
2012-09-05 15:03:35 +00:00 |
Alex Cunningham
|
9ce892ce65
|
gtsam_unstable now builds and tests pass
|
2012-05-03 17:03:25 +00:00 |