Thank you very much for your helpful answers. I think this forum should be elected as the best forum of the year
. I've never seen a place like this where authors of an algorithm reply to all who write and with such rapidity and completeness :)
Anyway, as far as I've understood, the problem of using non-continuous odometry as input for rtabmap is that the graph could result in discreet jumps, thus leading to a broken map with holes, brutally said. But couldn't potentially happen the same thing with loop closure? When a loop closure is detected, the graph is optimized, and I think that even the optimization could lead to "discreet jumps", thus breaking parts of the map.
Is this true? If yes, does rtabmap takes into account this problem? Is it equipped with some strategies to preserve the integrity of the map, meaning that there no unmatched surfaces?