Next: Improving Registration Accuracy
Up: Range Data Registration
Previous: Registerable Feature Type
The correspondence search algorithms generally have a large potential
space to search through in order to find corresponding features.
There are several approaches to reducing the computational complexity of
this search, including coarse-to-fine strategies
(12,29,57,41,69).
The use of k-D trees is particularly popular (e.g. (62,21)).
Bob Fisher
2003-07-13