Test point in triangle

This is an alternative implementation to test if a point is located within a triangle. It uses barycentric coordinates instead of the Gauss algorithm used by @TomFischer 

We've tested this with some of Norberts examples where Tom's algorithm had problems and didn't find all relevant points. This new algorithm also did not find all points, although different points are missing and at least in the tested cases *fewer* points were missing. (I also suspect this algorithm is faster if used for a *lot* of points)

I don't know if we want to merge this, I just put it up as a PR so it isn't forgotten and you can decide if we want to keep it or not. I'll fix all strange names and tests if it is to be merged.
If someone wants to take a look at the mathematics behind this, I can give you the book mentioned in the comments.
Of course. This is really just a test implementation I did for Norbert and I just wanted to know if we want to keep it and if so, if I should remove Tom's function or if we want to keep two functions which ultimately do the same thing.