OBB Intersect Test Algorithm Based on Effective Constraint
Lifang Bai · 2016
In light of collision detection problems in virtual environments, this paper makes a further study on the OBB(Oriented Bounding Box) intersection test.We describe the convex polyhedron by linear inequalities, achieve a matrix dimension reduction by simplifying the original coefficient matrix utilizing the corresponding row of the hyperplane which corresponds to the effective constraint inequality, and give a mathematical theoretical condition of the matrix dimension reduction, i.e, the effective constraint theorem.The algorithm only needs to operate the first column of matrix elements through the elementary transformation, and if necessary, related rows and columns will be rejected, then we can determine whether the test OBB intersects .Comparing the test speed and accuracy in the static case and dynamic case, experimental results show that speed of the new algorithm is 2-3times faster than that of the traditional OBB intersection algorithm, and the accuracy of the proposed algorithm is also not inferior to that of the SAT-based algorithm.