文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Abstract Curve fitting for styling application by
侵权投诉

Abstract Curve fitting for styling application by

The fitting of curves in computer aided geometric design is generally regarded as an optimisation problem. According to the application, conditions to be satisfied can make the problem difficult to solve with classical methods. Stochastic ones, such as gen

Sliikk

Figure 2 : Curve deviation di calculation

By knowing these arc lengths and by applying the property of cubic typical curves concerning their arc lengthderivative, which we do not detail here (see [7]), it comes, at last, the curve point C(ui) location.

3.4. Generation of the initial population

A difficulty with genetic algorithm in a continuous optimization problem, we face with, is the large number ofpossible solutions, which can be generated within the search domain. In case of a too wide one, a risk thereforeexists by random sampling, unless to generate a great number of individuals, to not cover homogeneously thewhole solution space and consequently to converge to a local optimum. To avoid this, before generating theinitial population, we search to fit the search domain of each variable, according to some approximations and/orempirical rules. Thus, the initial tangent direction W0 and curvature 0 are estimated by means of a discrete shapeanalysis. The domain estimation for the other variables is, on the other hand and until now, empirically made.

3.5. Crossover and mutation operators

We have developed two crossover operators, respectively dedicated to the initial curve variables (W0, 0) and tothe shape segment variables ( k , k).The crossing consists here just in exchanging their initial variables values between two individuals. The shape segment variables values in the initial population , contrarily to the previous ones, are not necessarilyclose to good solutions. This is particularly the case for the k variables which determine the curve nodes locationand for which meaningful estimation is difficult. Therefore, we used a crossover operator which combines ( k , k) variables values and generates new ones. It proceeds according to a one point crossover method. A crossoverpoint s, 1 s m, is selected at random, as well as a weight w, 1/3 w 2/3. Given two individuals A and B :

(W0,A, 0,A), ( 1,A, 1,A) ... ( m,A , m,A) (W0,B, 0,B), ( 1,B, 1,B) ... ( m,B , m,B)

we generate two new individuals A’ and B’ with new segment variables ( k,A’ , k,A’) and ( k,B’ , k,B’) as :

if k s( k,A’ , k,A’) = w ( k,A , k,A) +(1- w) ( k,B, k,B) ,

( k,B’ , k,B’) = (1-w) ( k,B , k,B) + w ( k,A, k,A)

if k s( k,A’ , k,A’) = (1-w) ( k,A , k,A) + w ( k,B, k,B) ,

( k,B’ , k, B’) = w ( k,B , k,B) + (1-w) ( k,A, k,A)

The mutation operator, we use, proceeds in a classic way. After selecting at random an index within 0,m , weobtain a new individual by generating randomly a new value for either the (W0, 0) or a ( k , k) variables subset.

4. General algorithm and first results

We give here a global view on our algorithm, knowing that its development is still in progress.

Program Curve_Fitting_by_GA

Generate the initial population;Identify the best and the worst individuals;

While ( mean_fitness – best_fitness) > given threshold_value

Select randomly two individuals;Generate two new individuals by crossover and keep the best offspring;

If offspring_fitness < worst_fitnessThenMutate it according a given probability_rule;

上一页第3页

你可能喜欢

  • 小学英语课堂教学warm_up
  • 英语课堂热身warm_up
  • fzxs服装欣赏
  • 英语课堂热身warm
  • dill pickle课后答案
  • 英语课堂warm

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email