forked from bartvdbraak/blender
e38c1a5ae7
The Euclidean resection code had a magical constant, 1e-3, used to compare the results of solving an equation. This failure detection was well-intended, trying to prevent poor solutions from getting made without notifying the caller. Unfortunately in practice, this threshold is too conservative. Furthermore, it is not clear the threshold should exist at all; the purpose of the Euclidean resection is to come up with the best solution it can; other methods (e.g. reprojection error) should be used to compare whether the method succeeded. This commit changes the Euclidean EPnP code to always succeed, causing the previous fallback to projective resection to never run. In most cases, this will result in better reconstructions. This should, in most cases, fix the dreaded "flipping" problem. |
||
|---|---|---|
| .. | ||
| libmv | ||
| patches | ||
| third_party | ||
| bundle.sh | ||
| ChangeLog | ||
| CMakeLists.txt | ||
| files.txt | ||
| libmv-capi.cpp | ||
| libmv-capi.h | ||
| mkfiles.sh | ||
| SConscript | ||