APPLYING SIMULATED THE ANNEALING GENETIC ALGORITHM IN SURFACE INTERSECTION

In this paper, genetic algorithm and marching method are integrated in the new algorithm to solve the surface intersection problem. By combining genetic algorithm with local searching method the efficiency of evolution is greatly improved. By fully utilizing the global searching ability and instinct attribute for parallel computation of genetic algorithm and the local rapid convergency of marching method, the algorithm can compute the intersection robustly and generate correct topology of intersection curves. The new algorithm is discussed in detail. The algorithm has been implemented in a prototype system TigerSurf based on Windows/NT platform, and a sound result is obtained from the test datum.