Badouel intersection algorithm: Difference between revisions
Content deleted Content added
added Category:Algorithms; removed {{uncategorized}} using HotCat |
Added {{unreferenced}} tag to article (TW) |
||
| Line 1: | Line 1: | ||
{{unreferenced|date=July 2017}} |
|||
{{Underlinked|date=June 2017}} |
{{Underlinked|date=June 2017}} |
||
Revision as of 09:21, 4 July 2017
 |
 | This article needs more links to other articles to help integrate it into the encyclopedia. (June 2017) |
The Badouel ray-triangle intersection algorithm, named after its inventor Didier Badouel, is a fast method for calculating the intersection of a ray and a triangle in three dimensions without needing precomputation of the plane equation of the plane containing the triangle.
External links
- Ray-Polygon Intersection An Efficient Ray-Polygon Intersection by Didier Badouel from Graphics Gems I