CG: optimize projection of point on a triangle #221
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
roccoarpa
approved these changes
Aug 30, 2021
Instead of using LAPACK to solve the linear system system for obtaining the barycentric coordinates, the system is solved using Cramer's rule.
andrea-iob
force-pushed
the
CG.optimize.point.triangle.projection
branch
from
bab3934
to
b49eac7
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Barycentric coordinates can be evaluated solving a 2x2 linear system. The system is solved using Cramer's rule.
The function _projectPointsTriangle is now 4 times faster than before and this makes SurfaceSkdTree::findPointClosesCell 1.6 times faster.
After this change, module CG doesn't depend on LAPACKe library anymore.