Jump to content

Badouel intersection algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BigHaz (talk | contribs) at 09:21, 4 July 2017 (Added {{unreferenced}} tag to article (TW)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Badouel intersection algorithm" – news · newspapers · books · scholar · JSTOR (July 2017) (Learn how and when to remove this message)

This article needs more links to other articles to help integrate it into the encyclopedia. Please help improve this article by adding links that are relevant to the context within the existing text. (June 2017) (Learn how and when to remove this message)

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Badouel_intersection_algorithm&oldid=788926295"

Hidden categories: