Surface/Surface Intersection Using Simulated Annealing Genetic Algorithm

被引：0
作者：
唐敏
机构：
来源：
High Technology Letters | 2000年 / 04期
关键词：
Surface intersection; Marching method; Simulated annealing genetic algorithm;
D O I：
暂无
中图分类号：
TP391.41 [];
学科分类号：
080203 ;
摘要：
The genetic algorithm and marching method are integrated 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 convergency 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.
引用
收藏
页码：39 / 45
页数：7
相关论文
共 14 条
[1]  
Stoyanov T E. Computer Aided Geometric Design . 1992
[2]  
Requicha A G,Voelcker H B. IEEE Computer Graphics and Applications . 1992
[3]  
Sederberg T W,Meyers R J. Computer Aided Geometric Design . 1988
[4]  
Chun-Yi Hu,Takashi Maekawa,et al. Computer Aided Design . 1997
[5]  
Wu S T,Andrade L N. Computer Aided Geometric Design . 1999
[6]  
Mullenheim G. Computer Aided Geometric Design . 1991
[7]  
Muhlenbein H,Schomisch M,Born J. Parallel Computing . 1991
[8]  
Kenin J Wiler. IEEE Computer Graphics and Applications . 1985
[9]  
Requicha A G,et al. IEEE Computer Graphics and Applications . 1992
[10]  
Sederberg T W,Nishita T. Computer Aided Geometric Design . 1991
12