Ilian,
Premise:
- We have already succesfully implemented the PointInFrustum() algorithm
- Now we need to check if the segment intersect one of the finite frustum planes (polygons), not the infinite ones.
It easy for us to clip the segment with planes and check if the points are laying on the right side of the planes but this means we need to find intersection for almost all the entities (infinite planes cut something everywhere) and it’s pretty slow.
I am sure there is a more straightforward way to do it.
Thanks,
Alberto