Delaunay triangulation and piecewise-affine Registriation #422
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
To finish my point-pairs based registration algorithm contribution, I'd like to add this code to the master. The idea behind the piecewise-affine registration is that the point sets are first delaunay triangulated. Then, the contents of each triangle in the source image is transformed using an affine transformation to the target triangle. Since the delaunay triangulation uses LEMON, both - the delaunay triangulation as well as the piecewise-affine registration need (and check for!) the WITH_LEMON condition.
A test is also included by means of an extension to the registration/test.cxx test.
Best wishes,
Benjamin