OurBigBook About$ Donate
 Sign in Sign up

Triangle-triangle intersection algorithm

 Ancestors will show here when the tree index is updated
2026-10-14  NaN By others on same topic  0 Discussions Create my own version
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

 Incoming links (4)

  • Bounding volume
  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 77 / 1 / iii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 77 / 1 / ii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 77 / 1 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (NaN)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook