search

cstew2 / asicp

Anisotropically Scaled Iterative Closest Point Algorithm
25 stars 3 forks source link

asicp.cxx #3

Open dugushiyu opened 4 years ago

dugushiyu commented 4 years ago

1.if change std::uniform_real_distribution reals(0.8,1.2) to std::uniform_real_distribution reals(80,150); asicp is does not work; 2.kd-tree ;why kd_tree_t kd_tree(3, X_scale, 10); ....double query[3]; query[0] = X_scale(0,i); query[1] = X_scale(1,i); query[2] = X_scale(2,i); kd_tree.index->findNeighbors(result_set, &query[0], nanoflann::SearchParams(10)); THERE x-tree find query-x??? Y_close.col(i) = X_curr.col(ret_index);Y_close.col(i) = Y_trans.col(ret_index);

thanks ! Look forward to your reply

cstew2 commented 4 years ago

So this project was just me trying to do an implementation of the algorithms in C++ with Eigen to learn more about it. I am pretty sure it doesn't work as is, it's just a project I work on when I have some spare time.

dugushiyu commented 4 years ago

Thank you very much for your reply. I don't know if you are still improving this project. If you continue, I look forward to working with you to further improve this project. Asicp projects are very few.