Simulated annealing genetic algorithm for surface intersection

Authors:
Min Tang;Jin-xiang Dong
Affiliations:
State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou, China;State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 5
Cited 1

On determining start points for a surface/surface intersection algorithm

Computer Aided Geometric Design
Registration of 3-D images by genetic optimization

Pattern Recognition Letters - Special issue on genetic algorithms
A new approach to the surface intersection problem

Computer Aided Geometric Design
Marching along a regular surface/surface intersection with circular steps

Computer Aided Geometric Design
Genetic Search for Structural Matching

ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I

The Current State and Future of Search Based Software Engineering

FOSE '07 2007 Future of Software Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper integrated genetic algorithm and marching method into a novel 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 convergence of marching method, the algorithm can compute the intersection robustly and generate correct topology of intersection curves. The details of the new algorithm are discussed here. The algorithm have been implemented in a prototype system named TigerSurf based on Windows/NT platform, and a soundly result is gotten from test datum.