so i have a personal project, for which i need an algorithm which tells me if a given Cylinder and given Triangle intersect with each other. Along these lines;
Thats an intersection.
This is also a intersection.
This is no intersection.
I found some papers which appear to do this, but they all have some downside that dosnt allow me to use it. The most common reason is that these papers only concern themselfs with Planes and not triangle intersections.
I would assume the algorithm for this would need the triangle points p0-p2, the triangle Normal, the cylinder direction and cylinder radius. All of which i can provide in the program, but i sadly dont really know how to make such an algo.
So yeah, any help would be coold :D Thank you for reading !
EDIT; Just to clarify, this algo would be used to determain if a Star with a given radius hits a Pixel. It dosnt matter where the Cylinder intersects the Triangle (2 Triangles = 1 Pixel) just if it does. I hope that makes it a bit simpler...