You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello:
In Mourikis's paper, he says givens rotation is a convenient and "can be computed efficiently" solution. When I debug a mono version of msckf, I find the H matrix is not very sparse. Is the H matrix in your code sparse or you find this method is faster than givens rotation?
The text was updated successfully, but these errors were encountered:
Hello:
In Mourikis's paper, he says givens rotation is a convenient and "can be computed efficiently" solution. When I debug a mono version of msckf, I find the H matrix is not very sparse. Is the H matrix in your code sparse or you find this method is faster than givens rotation?
The text was updated successfully, but these errors were encountered: