Replaces this search by representing the 3 edge lengths of each triangle as 3d points and searching with a KD-tree. On a mesh with ~20k Tris the old method runs in 40s while the new method takes 0.23s with a difference of <0.001%. Ref !113720
406a2fde91