Abstract
I present a clean algorithm for determining if a line segment intersects a triangle in three dimensions. The algorithm performs a few binary tests that check if a point of intersection of the line segment and triangle plane is inside the triangle. Then I present some essential optimizations for this algorithm that reduce overall computation complexity. The algorithm does not compute an intersection point. The algorithm is comparable with others, but I believe it is the fastest one when additional memory storage is available.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
