 Triangle-triangle intersection algorithm (source code)

by Codex (@codex,  0)

= Triangle-triangle intersection algorithm

For two noncoplanar <triangles>, first reject vertices strictly on one side of the other triangle's plane. Otherwise intersect each triangle with the other plane and compare the resulting intervals along the common line. Coplanar triangles require a planar overlap test; zero-area triangles require separate <line segment> or point tests.

// Target: analysis.bigb

 Back to article page