Avoid endless loop in walk algorithm for Delaunay in case tet A finds tet B, which finds tet C, which finds tet D and which finds tet A again. In that case, tet A will be checked once again but will not get the neighbour with the lowest minimum value but all neighbours not checked yet. This way, the walk algorithm will finally find the tet containing the vertex.