Badouel intersection algorithm: Difference between revisions
Content deleted Content added
the stub template already adds a cat |
→External links: uncategorized |
||
| Line 5: | Line 5: | ||
== External links == |
== External links == |
||
* [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=July 2020}} |
|||
{{Algorithm-stub}} |
{{Algorithm-stub}} |
||
Revision as of 19:24, 27 July 2020
 | This article needs additional citations for verification. (January 2019) |
The Badouel ray-triangle intersection algorithm, named after 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
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (July 2020) |
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |