Never tried so many points, maybe I give it a try later. I think it's part time the language choice and the fact, that my algorithm probably runs in Omega(n lo

Never tried so many points, maybe I give it a try later. I think it's part time the language choice and the fact, that my algorithm probably runs in Omega(n logn) but might not reach O(n logn)... Maybe you got an idea: My bottleneck is to find the triangle in which a new point lies. Right now I go through the triangle-mesh in the direction of the point, hoping to find the right triangle fast. Most of the time, it does ...