Contact Search by Soft Computing

Abstract

This paper describes a new local contact searching method using a genetic programming. Generally, contact searching process consists of two phases : a global searching phase for finding nearest node segment pair and a local searching phase for finding exact local coordinates of the contact point in the segment found. In the present method, a genetic programming is utilized for finding an approximating function for local coordinates of the contact point with coordinate values of corresponding nodes. In this paper, the fundamental formulation of the local contact searching method is described in detail and basic performance of the method is demonstrated through sample analyses.