Badouel intersection algorithm: Difference between revisions
Content deleted Content added
bolding |
added Category:Algorithms; removed {{uncategorized}} using HotCat |
||
| Line 6: | Line 6: | ||
* [https://graphics.stanford.edu/courses/cs348b-98/gg/intersect.html Ray-Polygon Intersection] An Efficient Ray-Polygon Intersection by Didier Badouel from Graphics Gems I |
* [https://graphics.stanford.edu/courses/cs348b-98/gg/intersect.html Ray-Polygon Intersection] An Efficient Ray-Polygon Intersection by Didier Badouel from Graphics Gems I |
||
{{Uncategorized|date=June 2017}} |
|||
[[Category:Algorithms]] |
|||
Revision as of 17:03, 30 June 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