z-logo
Premium
A faster triangle‐to‐triangle intersection test algorithm
Author(s) -
Lingyu Wei
Publication year - 2013
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.1558
Subject(s) - intersection (aeronautics) , plane (geometry) , isosceles triangle , line (geometry) , computer science , algorithm , line segment , triangle inequality , combinatorics , triangle mesh , mathematics , geometry , artificial intelligence , computer graphics (images) , polygon mesh , engineering , aerospace engineering
The triangle‐to‐triangle intersection test is the most basic component of collision detection. And our algorithm, which firstly computes the line segment between triangle A and the plane of triangle B and uses a new method to detect the intersection between this line and triangle B, can reduce about 10% of time on average, compared with the previous fastest algorithm. Our new method divides the plane of triangle B into four quarter planes by two edges of B, and detects intersection depending on the location of the two endpoints of the segment. After using some techniques like avoiding division and projecting the segment and triangle B on XY, YZ, or ZX plane, the total number of arithmetic operations is reduced to at most 87, which is less than any existing algorithms. Copyright © 2013 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here