Badouel intersection algorithm: Difference between revisions
Content deleted Content added
Added {{unreferenced}} tag to article (TW) |
Sadenar40000 (talk | contribs) m added template algorithm stub |
||
| Line 1: | Line 1: | ||
{{unreferenced|date=July 2017}} |
{{unreferenced|date=July 2017}} |
||
{{Underlinked|date=June 2017}} |
{{Underlinked|date=June 2017}} |
||
{{Algorithm-stub}} |
|||
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. |
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. |
||
| Line 9: | Line 10: | ||
[[Category: |
[[Category:Computer science stub templates]] |
||
Revision as of 22:49, 8 December 2018
 |
 | This article needs more links to other articles to help integrate it into the encyclopedia. (June 2017) |
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
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