Upload
faunia
View
111
Download
1
Tags:
Embed Size (px)
DESCRIPTION
Subdivision of Bezier curves. Raeda Naamnieh. Outline. motivation. Definitions. Definition 5.7 For , the functions for where n is any nonnegative integer, are called the generalized Bernstein blending functions. . Definitions. - PowerPoint PPT Presentation
Citation preview
1
Subdivision of Bezier curves
Raeda Naamnieh
2
Outline
Subdivision of Bezier Curves
Restricted proof for Bezier Subdivision
Convergence of Refinement Strategies
3
MOTIVATION
4
Definitions
• Definition 5.7 For , the functions
for where n is any nonnegative integer, are called the generalized Bernstein
blending functions .
5
Definitions
• Definition 16.11We call
the Bezier curve with control points on the interval .
6
• For defined as above then
where
THE BEZIER CURVE SUBDIVISION THEOREM
7
THE BEZIER CURVE SUBDIVISION THEOREM
8
THE BEZIER CURVE SUBDIVISION THEOREM
9
Outline
Subdivision of Bezier Curves
Restricted proof for Bezier Subdivision
Convergence of Refinement Strategies
10
Restricted Proof for Bezier Subdivision
• Lemma 16.22
11
Restricted Proof for Bezier Subdivision
• Proof:
12
Restricted Proof for Bezier Subdivision
• Proof:
13
Restricted Proof for Bezier Subdivision
• Proof for Bezier Subdivision: induction on n, and for arbitrary c, a<c<b.
If n=1
14
Restricted Proof for Bezier Subdivision
• Proof for Bezier Subdivision:Now, assume the theorem holds for all
15
Restricted Proof for Bezier Subdivision
• Proof for Bezier Subdivision:Now using the results from
16
Restricted Proof for Bezier Subdivision
• Proof for Bezier Subdivision:-The second part of the proof is almost identical, hence left as exercise
21
Outline
Subdivision of Bezier Curves
Restricted proof for Bezier Subdivision
Convergence of Refinement Strategies
22
Convergence of Refinement Strategies
𝑃1[0 ]
𝑃4[0 ]
𝑃3[0 ]
𝑃2[0 ]
𝑃0[0 ]
SUBDIVISION AT THE MIDPOINT
23
Convergence of Refinement Strategies
𝑃1[0 ]
𝑃4[0 ]
𝑃3[0 ]
𝑃2[0 ]
𝑃0[0 ]
𝑃1[1 ]
𝑃2[1 ]
𝑃3[1 ]
𝑃4[1 ]
24
Convergence of Refinement Strategies
𝑃1[0 ]
𝑃4[0 ]
𝑃3[0 ]
𝑃2[0 ]
𝑃0[0 ]
𝑃1[1 ]
𝑃2[1 ]
𝑃3[1 ]
𝑃4[1 ]
𝑃2[2 ]
𝑃3[2 ]
𝑃4[2 ]
25
Convergence of Refinement Strategies
𝑃1[0 ]
𝑃4[0 ]
𝑃3[0 ]
𝑃2[0 ]
𝑃0[0 ]
𝑃1[1 ]
𝑃2[1 ]
𝑃3[1 ]
𝑃4[1 ]
𝑃2[2 ]
𝑃3[2 ]
𝑃4[2 ]
𝑃3[3 ]
𝑃4[3 ]
26
Convergence of Refinement Strategies
𝑃1[0 ]
𝑃4[0 ]
𝑃3[0 ]
𝑃2[0 ]
𝑃0[0 ]
𝑃1[1 ]
𝑃2[1 ]
𝑃3[1 ]
𝑃4[1 ]
𝑃2[2 ]
𝑃3[2 ]
𝑃4[2 ]
𝑃3[3 ]
𝑃4[3 ]𝑃4
[4 ]
27
Convergence of Refinement Strategies
𝑃1[0 ]
𝑃4[0 ]
𝑃3[0 ]
𝑃2[0 ]
𝑃0[0 ]
𝑃1[1 ]
𝑃2[1 ]
𝑃3[1 ]
𝑃4[1 ]
𝑃2[2 ]
𝑃3[2 ]
𝑃4[2 ]
𝑃3[3 ]
𝑃4[3 ]𝑃4
[4 ]
28
Convergence of Refinement Strategies
o Bezier polygon defined on .o the piecewise linear function given by the
original polygon.o the piecewise linear function formed with
vertices defined by concatenating together the control polygons for the two subdivided curves
and at the midpoint.o It has 2n+1 distinct points.
29
Convergence of Refinement Strategies
o is a pisewise linear function defined by the ordered vertices of the control polygons of the Bezier curves whose composite is the original curve.
30
Convergence of Refinement Strategies
o is a pisewise linear function defined by the ordered vertices of the control polygons of the Bezier curves whose composite is the original curve.
31
Convergence of Refinement Strategies
o is a pisewise linear function defined by the ordered vertices of the control polygons of the Bezier curves whose composite is the original curve.
32
Convergence of Refinement Strategies
o The subdivided Bezier curve at level is over the interval:
and has vertices:
for oWe shall write
has distinct points which define it.
33
Convergence of Refinement Strategies
Theorem 16.17:
That is, the polyline consisting of the union of all the sub polygons converges to the Bezier curve .
34
Convergence of Refinement Strategies
Lemma 16.18:If is a Bezier curve, define
. If Are defined by the rule in Theorem 16.12, then
for
35
Convergence of Refinement Strategies
Proof:By induction on the superscript, for,
36
Convergence of Refinement Strategies
Proof:Now, suppose that the conclusion has been shown for superscripts up to .Then,
37
Convergence of Refinement Strategies
Lemma 16.19:Any two consecutive vertices of are no farther
apart than ,where is independent of. That is, if and are two consecutive vertices of
Then.
38
Convergence of Refinement Strategies
Proof:Induction on,
Let First consider and
39
Convergence of Refinement Strategies
Proof:Let
where
40
Convergence of Refinement Strategies
Proof:Now, suppose
41
Convergence of Refinement Strategies
Proof:Assume for . Now we show it is true
for. The vertices in are defined by subdividing the Bezier
polygons in. We see that are formed by
subdividing the Bezier curve with control polygon
where respectively.
42
Convergence of Refinement Strategies
Proof:We shall prove the results for
Let us fix And call
By the subdivision Theorem 16.12
43
Convergence of Refinement Strategies
Proof:
Since this is proved for all the conclusion of the lemma holds for all
44
Convergence of Refinement Strategies
Proof for convergence theorem:The subdivision theorem showed that over each
subinterval , the Bezier curve resulting from the appropriate sub
collection of is identical to the original We denote this by.
45
Convergence of Refinement Strategies
Proof for convergence theorem:Any arbitrary value in the original interval is then contained in an infinite sequence of intervals,
for which
46
Convergence of Refinement Strategies
Proof for convergence theorem:Hence, the curve value, lies within the convex hull of the vertices of which correspond to the Bezier polygon over
, for each .
47
Convergence of Refinement Strategies
Proof for convergence theorem:Since the spacial extent of the convex hull of each Bezier polygon over
,all and , gets smaller and converges to zero .
48
Convergence of Refinement Strategies
Proof for convergence theorem:Consider the subsequence of polygons corresponding
to the intervals containing. is contained in all of them, for all
Further, if any other curve point were contained in all of them, say , then would be in
49
Convergence of Refinement Strategies
Proof for convergence theorem:Since is the only point in that intersection ,
is the only point in the intersection of the convex hull of the Bezier polygons of these selected subintervals.
The polygonal approximation converges.
50
Summary
• Subdivision of Bezier Curves
• Restricted proof for Bezier Subdivision
• Convergence of Refinement Strategies
51
Appendix
Geometric Modeling with Splines
Chapter 16Elaine CohenRichard F. RiesenfeldGershon Elber
52
Q&A