Simulated annealing: theory and applications
Simulated annealing: theory and applications
A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Theoretical Computer Science
Hi-index | 0.00 |
We present two absolute error approximation algorithms for a point-to-surface registration problem in 3D with applications in medical navigation systems. For a given triangulated or otherwise dense sampled surface S, a small point set P ⊂ R3 and an error bound µ we present two algorithms for computing the set T of rigid motions, so that the directed Hausdorff distance of P transformed by any of these rigid motions to S is at most the Hausdorff distance of the best semioptimal matching plus the user chosen error bound µ. Both algorithms take advantage of so called characteristic points Sc ⊂ S and Pc ⊂ P which are used to reduce the search space significantly. We restrict our attention to scenarios with |Pc| = 2. The algorithms are implemented and compared with respect to their efficiency in different settings.