Fast Algorithm Contact Judgment And Project

There are global search and local search in the contact search algorithm. Global search roughly find out all possible potential points around specific points. After global search, the purpose of local search is to find the contact node. In this paper, some contact search algorithms are simple in the global search algorithm, but the algorithms are more tedious in local search. When dealing with the shape of the distorted tool there are a lot of iterative procedure in some algorithms; dealing with the boundary problem in some algorithm, some nodes couldn't be detected. Doing some helpful contribution to this field is right the aim of the present paper. The main work can be shown as followings:In the global search algorithm, if a point may be determined in a unit or not, we compare the value of the node coordinate of size with the value of a small rectangle of unit face four vertices coordinate to judge whether may for the contact point. And fast algorithm is compared to inside-outside algorithm which is needed at least eight times to judge a point, which is largely simplified the search process.In the local search, the determination of the positive and negative to we judge the node on the unit or in the unit surface according to n-n1=|n|·|n1|cosθ Then calculate the coordinate of the projection point P to solve the amount of penetration according to the triangle rule.The inside-outside algorithm is improved from the implementation algorithm and formed a new fast search algorithm in this paper, the inside-outside algorithm compare with fast search algorithm in the complex degree algorithm which is simpler than that algorithm. The results show the fast algorithm is better than the inside-outside algorithm.