Can you guys provide me with a brief math proof that searched direction always contains at least one rectangles vertex (that is, no need to search for it between those rays made from vertexes coordinates)?
Thanks.

In a small enough neighborhood of a line that does not pass thru one of the vertices, the distance traveled inside rectangle is smaller on one side and larger on the other, thus the distance on the line is not smaller/larger than in the neighborhood.