Badouel intersection algorithm
The Badouel ray-triangle intersection algorithm, named after inventor , 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.
- Comment
- enThe Badouel ray-triangle intersection algorithm, named after inventor , 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.
- Has abstract
- enThe Badouel ray-triangle intersection algorithm, named after inventor , 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.
- Is primary topic of
- Badouel intersection algorithm
- Label
- enBadouel intersection algorithm
- Link from a Wikipage to an external page
- graphics.stanford.edu/courses/cs348b-98/gg/intersect.html
- Link from a Wikipage to another Wikipage
- Algorithm
- Category:Geometry
- Didier Badouel
- Dimension
- Intersection (Euclidean geometry)
- Plane (geometry)
- Plane equation
- Ray (geometry)
- Triangle
- SameAs
- 2r6nr
- Q30674982
- Subject
- Category:Geometry
- WasDerivedFrom
- Badouel intersection algorithm?oldid=970027880&ns=0
- WikiPageLength
- 648
- Wikipage page ID
- 54237359
- Wikipage revision ID
- 970027880
- WikiPageUsesTemplate
- Template:Algorithm-stub
- Template:Refimprove