Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Class A Curvature

Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 53

Class A Curve

Reporter: Cao Juan


Date: 2006.12.27
Outline:

References

Introduction

Available definition(2D,3D)

Application

Conclusion and future work


References:

A shape control fitting method for Bézier curves. CAGD,1998.


1 Yves Mineur, Tony Lichah, Jean Marie Castelain, Henri Giaume.

2 Class A Bézier curves. CAGD,2006.Gerald Farin

Curve fitting for styling application by genetic algorithm.


3 European Journal of Operational Research,2005. Yves Mineur.
Marc Sevaux.

B-spline to Class-A curves adaptation with k-neighbors LOD


4 processing. CAGD,2006.Giancarlo Amati, Alfredo Liverani.
Introduction:

“Class
A” “Aussenhaut”

Class A surface is a term used in automotive


design to describe a set of freeform surfaces of high
quality. Although, strictly, it is nothing more than
saying the surfaces are aesthetically pleasing, many
people interpret class A surfaces have G2 curvature
continuity to another one.
Examples(1):
Examples(2):
Introduction:

Why it is needed?

How to make class A?


Class A

mathematical challenges?
Sectional point from Feature curve Direct control
clay model

Diagnosis quality Surpport surface

Completed Class A part


Definition:

2D
2D 3D
3D
(typical
(typicalcurve)
curve)
by
byGerald
GeraldFarin
Farin
by
byYves
YvesMineur
Mineuret
etal
al 2003
2003
CAGD
CAGD(1998)
(1998) CAGD
CAGD(2006)
(2006)
Definition (2D):

Bézier,1986
Definition (2D):
Definition (3D):

2D 3D
Conditions of M(1):

Geometric view

Positive
define:
Monotonity(1):
Conditions of M (2):

Geometric view
Geometry view:

non-class A matrix almost class A matrix


Subdivision:
Monotonity(2006):

n=3
A query:

DOall matrixes satisfy the second


condition?

t=0.5
Application(1.1):

A shape control fitting method for Bézier curves. CAGD,1998.


1 Yves Mineur, Tony Lichah, Jean Marie Castelain, Henri Giaume.
Problem
description

Given a set of 2D date points (P1, …, Pn)

Generate a Class-A curve joining the points P1 and


Pn and pass close to the intermediate points
Application(1.2)

Constraints (order 3,5):

Regions for a monotonic curvature variation:


Application(1.3):

Step 1
Choose an initial values of angles

Step 2
Determine a modification point
and its displacement vector
Application(1.4):

approximation
approximation

Assumption :
The new point is
on the starting curve
Application(1.5):

Reasoning
Reasoning
Compare with Least squares (1.1):

Original curve

3rd degree curves


Compare with Least squares (1.2):

4rd degree curves

5rd degree curves


Application(2.1):
Curve fitting for styling application by genetic algorithm.
3 European Journal of Operational Research,2005. Yves Mineur.
Marc Sevaux.

Problem
description

Fitting 2D points with G2 Class-A Bézier curves.


Genetic algorithm(2.1):

GA:

1.Randomly generate an initial population M(0)


2.Compute and save the fitness u(m) for each individual m
in the current population M(t)
3.Define selection probabilities p(m) for each individual m
in M(t) so that p(m) is proportional to u(m)
4.Generate M(t+1) by probabilistically selecting individuals
from M(t) to produce offspring via genetic operators
(crossover & mutate )
5.Repeat step 2 until satisfying solution is obtained.
Genetic algorithm(2.2):

Assumption:

Underlying shape is curvature monotonic


1
Fixed number of segments
2

3
Genetic algorithm(2.3):
Genetic algorithm (2.4)
Genetic algorithm (2.5)

3
Genetic algorithm (2.6)
result (2.1):
result (2.2):
result (2.3):
Comments:

Non-sequential or uneven point set

Variable segment number


Application(3.1):

B-spline to Class-A curves adaptation with k-neighbors LOD


4 processing. CAGD,2006.Giancarlo Amati, Alfredo Liverani.

Problem
description

lots of B-spline curves don’t hold the property


of Class A, i.e.,

How to transform them to Class A curves as


closely as possible to original curves?
Application(3.2)

Multi-resolution analysis
Add your text in here

Approximation spaces:

Basis functions:
Application(3.3):

Multi-resolution analysis
Add your text in here

Direct sum:

Multi-resolution:

Minimal requirement:
Application(3.4):

B-spline wavelet
Add your text in here

k order B-spline basis functions defined over:

define a space of piecewise polynomials


Application(3.5):

B-spline wavelet
Add your text in here

k order B-spline basis functions:

B-spline wavelet:
Application(3.6):

B-spline wavelet
Add your text in here

B-spline curves can be represented as:

Control point relation:


Class-A adaptation algorithm of
k-neighbors LOD methods:

Click to add Title


Setp(1) control point position scanning: extract bad control
point (does not satisfy Class-A properties) at finest level
Class-A adaptation algorithm of
k-neighbors LOD methods:

Setp(2) Curve MRA analysis: extract finer lever details


coefficients relate to the bad control point
Class-A adaptation algorithm of
k-neighbors LOD methods:

Setp(3) Recovery step and details manipulation: all details


that determine the k-neighbors control points position of the
bad point are thresholded.

• Case k = 0: may still a non-Class-A curve, increase k


• Case k >0:
Algorithm tests(1):
original
curve

result
curve
Error estimation:
Algorithm tests(3):

Original
Curve
Algorithm test(2):

K=3
Algorithm tests(3):

K=5
Conclusion and future work:

1 Class-A B-spline curve (construction)

2 More flexible method of construction

3 Application (point set, non-sequence…)

4 Space Class-A (Construction and application)


Thank you!

You might also like