Iterative Closest Point,
presented
by M.T. Hajiaghayi
Conclusions
-
Classified and Compared variants of ICP
-
Normal-space sampling for smooth meshes with sparse features
-
Overall speed depends most on choice of matching algorithm
-
Kd-trees are very efficient for finding closest point
-
Combination of variants can align two range images in
a few tens of ms
Next