Raeda Naamnieh 1. Outline Subdivision of Bezier Curves Restricted proof for Bezier Subdivision Convergence of Refinement Strategies 2.

Slides:



Advertisements
Similar presentations
Chapter 2 Revision of Mathematical Notations and Techniques
Advertisements

Introduction to Proofs
5.1 Real Vector Spaces.
Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
Recursive Definitions and Structural Induction
The Fundamental Theorem of Arithmetic (2/12) Definition (which we all already know). A number greater than 1 is called prime if its only divisors are 1.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Induction and recursion
Offset of curves. Alina Shaikhet (CS, Technion)
8 TECHNIQUES OF INTEGRATION. In defining a definite integral, we dealt with a function f defined on a finite interval [a, b] and we assumed that f does.
1 Dr. Scott Schaefer The Bernstein Basis and Bezier Curves.
09/09/02 Dinesh Manocha, COMP258 Properties of Bezier Curves Invariance under affine parameter transformation P i B i,n (u) = P i B i,n ((u –a)/(b-a))
Probability theory 2011 Convergence concepts in probability theory  Definitions and relations between convergence concepts  Sufficient conditions for.
Boyce/DiPrima 9th ed, Ch 11.2: Sturm-Liouville Boundary Value Problems Elementary Differential Equations and Boundary Value Problems, 9th edition, by.
12 INFINITE SEQUENCES AND SERIES The Comparison Tests In this section, we will learn: How to find the value of a series by comparing it with a known.
9.1Concepts of Definite Integrals 9.2Finding Definite Integrals of Functions 9.3Further Techniques of Definite Integration Chapter Summary Case Study Definite.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Induction and recursion
Splines III – Bézier Curves
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Functions Definition A function from a set S to a set T is a rule that assigns to each element of S a unique element of T. We write f : S → T. Let S =
Advanced Counting Techniques
Title: Functions, Limits and Continuity Prof. Dr. Nasima Akhter And Md. Masum Murshed Lecturer Department of Mathematics, R.U. 29 July, 2011, Friday Time:
1 Preliminaries Precalculus Review I Precalculus Review II
Induction and recursion
Curve Modeling B-Spline Curves
Chapter 6 Mathematical Induction
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
Section 5.3. Section Summary Recursively Defined Functions Recursively Defined Sets and Structures Structural Induction.
Area/Sigma Notation Objective: To define area for plane regions with curvilinear boundaries. To use Sigma Notation to find areas.
1 Dr. Scott Schaefer Smooth Curves. 2/109 Smooth Curves Interpolation  Interpolation through Linear Algebra  Lagrange interpolation Bezier curves B-spline.
Nonoverlap of the Star Unfolding Boris Aronov and Joseph O’Rourke, 1991 A Summary by Brendan Lucier, 2004.
Angles & Lines Parallels & Transversals From Chapters 1 & 2 which angles do we know are congruent? And how do we know this? Vertical Angles.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 9/18/2008.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
12 INFINITE SEQUENCES AND SERIES. In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series.
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
Area of a Plane Region We know how to find the area inside many geometric shapes, like rectangles and triangles. We will now consider finding the area.
1 The Precise Definition of a Limit Section The Precise Definition of a Limit A geometric interpretation of limits can be given in terms of the.
Mathematical Induction Section 5.1. Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If.
Area/Sigma Notation Objective: To define area for plane regions with curvilinear boundaries. To use Sigma Notation to find areas.
Mathematical Induction
CompSci 102 Discrete Math for Computer Science March 13, 2012 Prof. Rodger Slides modified from Rosen.
Chapter Three SEQUENCES
Chapter 6 Integration Section 4 The Definite Integral.
Department of Statistics University of Rajshahi, Bangladesh
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
INFINITE SEQUENCES AND SERIES The convergence tests that we have looked at so far apply only to series with positive terms.
Finite Element Method. History Application Consider the two point boundary value problem.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Chapter 5 With Question/Answer Animations 1. Chapter Summary Mathematical Induction - Sec 5.1 Strong Induction and Well-Ordering - Sec 5.2 Lecture 18.
Area/Sigma Notation Objective: To define area for plane regions with curvilinear boundaries. To use Sigma Notation to find areas.
Theory of Computational Complexity M1 Takao Inoshita Iwama & Ito Lab Graduate School of Informatics, Kyoto University.
Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar Dr Nazir A. Zafar Advanced Algorithms Analysis and Design.
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
Strong Induction: Selected Exercises Goal Explain & illustrate proof construction of a variety of theorems using strong induction.
INFINITE SEQUENCES AND SERIES In general, it is difficult to find the exact sum of a series.  We were able to accomplish this for geometric series and.
Chapter 3 The Real Numbers.
Lecture 22 Definite Integrals.
Section 6. 3 Area and the Definite Integral Section 6
Induction and recursion
Chapter 3 The Real Numbers.
Quantum Two.
Efficient Methods for Roots of Univariate Scalar Beziers
Induction and recursion
The Bernstein Basis and Bezier Curves
Controllability and Observability of Linear Dynamical Equations
Advanced Analysis of Algorithms
Chapter 11: Further Topics in Algebra
Mathematical Induction
Presentation transcript:

Raeda Naamnieh 1

Outline Subdivision of Bezier Curves Restricted proof for Bezier Subdivision Convergence of Refinement Strategies 2

3

Definitions Definition 5.7 Definition 5.7 For, the functions for where n is any nonnegative integer, are called the generalized Bernstein blending functions. 4

Definitions Definition Definition We call the Bezier curve with control points on the interval. 5

For defined as above then where 6

7

8

Outline Subdivision of Bezier Curves Restricted proof for Bezier Subdivision Convergence of Refinement Strategies 9

Restricted Proof for Bezier Subdivision Lemma Lemma

Restricted Proof for Bezier Subdivision Proof: Proof: 11

Restricted Proof for Bezier Subdivision Proof: Proof: 12

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: induction on n, and for arbitrary c, a<c<b. If n=1 13

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: Now, assume the theorem holds for all 14

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: Now using the results from 15

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: - The second part of the proof is almost identical, hence left as exercise 16

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: We now show the theorem for the other part of the interval. Once again, set and 17

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: The argument for the right end of the interval proceeds the same way as above for the left side. 18

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: The argument for the right end of the interval proceeds the same way as above for the left side. 19

Restricted Proof for Bezier Subdivision Proof for Bezier Subdivision: Proof for Bezier Subdivision: The conclusion follows since 20

Outline Subdivision of Bezier Curves Restricted proof for Bezier Subdivision Convergence of Refinement Strategies 21

Convergence of Refinement Strategies 22

Convergence of Refinement Strategies 23

Convergence of Refinement Strategies 24

Convergence of Refinement Strategies 25

Convergence of Refinement Strategies 26

Convergence of Refinement Strategies 27

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. 28

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. 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 The subdivided Bezier curve at level is over the interval: and has vertices: for o We shall write has distinct points which define it. 32

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. 33

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 34

Convergence of Refinement Strategies Proof: By induction on the superscript, for, 35

Convergence of Refinement Strategies Proof: Now, suppose that the conclusion has been shown for superscripts up to.Then, 36

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. 37

Convergence of Refinement Strategies Proof: Induction on, Let First consider and 38

Convergence of Refinement Strategies Proof: Let where 39

Convergence of Refinement Strategies Proof: Now, suppose 40

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. 41

Convergence of Refinement Strategies Proof: We shall prove the results for Let us fix And call By the subdivision Theorem

Convergence of Refinement Strategies Proof: Since this is proved for all the conclusion of the lemma holds for all 43

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. 44

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 45

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. 46

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. 47

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 48

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. 49

Summary Subdivision of Bezier CurvesRestricted proof for Bezier SubdivisionConvergence of Refinement Strategies 50

Appendix Geometric Modeling with Splines Chapter 16 Elaine Cohen Richard F. Riesenfeld Gershon Elber 51

Q&A 52