文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 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

QFigure 1 : Gcomposite typical curve (3 segments)2

3.Fitting using a genetic algorithm

3.1. Statement of the problem

The composite curve we have defined allows the definition of different curve profiles or curve templates, throughthe combination of typical curves with a monotone increasing and/or decreasing curvature. This possibility comesat first sight with the user’s choice according to the considered data points set. The case that we chose to treat ina first step consists in fitting a curve on a data points set (Pi , i = 0..N) whose underlying shape presents aincreasing curvature variation.

We also considered the number m of curve segments as fixed. It can be indeed empirically chosen by the useraccording to the shape complexity. In the same manner, the point Q0 location and the total curve arc length S (S = Sk for k = 1..m) are fixed in advance as :

Q0 = P0 and S = Pj-1 Pj for j = 1..N

Provided that the data points do not present significant outlier points and their density is relatively high, the soestimated curve arc length gives, as proven by our results, good curve solutions.

3.2. Coding and fitness function

The genetic code we have defined consists in the following parameters set :

(W0, 0), ( 1, 1), ( 2, 2), ……..( m , m)where the first parameters subset corresponds to the tangent direction and curvature at Q0, and the following

subsets determine the m curve segments by the relations :

Sk = ( k - k-1) S , with k 0, 1 for k = 1..m-1 and 0 = 0 , m = 1

Wk = k k-1 Sk

where k-1 is the curvature at the ( k-1)th curve node, and where k is a parameter related to the curvature gradientof the kth segment. The previous variable aims to set the Wk values properly by taking into account the level ofcurvature at each curve node and the different segment arc length, so that the curvature variation is globallygrowing. Another advantage is to provide the search domain for each segment parameters subset with a relativehomogeneity.

Fitness of generated curves is determined according to the following function of the quadratic deviations:

Fitness 2

i 0N2di Pi C(ui) i 0N

where C(ui) is the curve point, normally defined as the nearest of the data point Pi. Calculating this point cannot be operated analytically and then must be numerically processed, which canincrease the global calculation cost, considering the number of data points and the number of iterations processedin a genetic algorithm. So, we developed an analytical curve deviation approximation method, based on an arclength parametrization. At first, we search the data points nearest to the curve nodes and define in that way, thecurve segment in the neighborhood of the considered data point. The arc length separating the correspondingcurve point from the beginning segment endpoint (Fig.2) is then written as :

k Si lk

LSk

where lk is the cumulated chord length, calculated on the considered data points segment, up to Pi , and thei

Lk the total length of this segment.

Abstract Curve fitting for styling application by

th curve kth data polygonal

Abstract Curve fitting for styling application by

segment

上一页第2页

你可能喜欢

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

热门文档

相关文档

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