0
$\begingroup$

In a 2D plane, I have a line segment ($P_0$ and $P_1$) and a triangle, defined by three points ($t_0$, $t_1$ and $t_2$).

My goal is to test, as efficiently as possible ( in terms of computational time), whether the line touches, or cuts through, or overlaps with one of the edge of the triangle.

What is the algorithm I can use for this?

  • 0
    You might be able to adapt [this](http://books.google.com/books?hl=en&id=ZQQssYF3i7wC&pg=PA257)...2011-12-14
  • 0
    @J.M., I think not. The ray-triangle intersection is in 3D, as such, we can talk about a ray passing through the triangle at a point. But this is not the situation in 2D. In 2D, the normal of the triangle and the 2D line is 90 degree apart.2011-12-14

1 Answers 1