1 / 33

Bernstein Polynomials, Bézier Curves, de Casteljau‘s Algorithm Shenqiang Wu

Bernstein Polynomials, Bézier Curves, de Casteljau‘s Algorithm Shenqiang Wu. Content. 1. Motivation 2. Problems of Polynom Interpolation 3. Bézier Curves 3.1 Bernstein Polynomials 3.2 Definition of Bézier Curves 3.3 Evaluation 4. Summary. Motivation (1/2).

mbird
Download Presentation

Bernstein Polynomials, Bézier Curves, de Casteljau‘s Algorithm Shenqiang Wu

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Bernstein Polynomials, Bézier Curves, de Casteljau‘s Algorithm Shenqiang Wu Computer Aided Geometric Design Ferienakademie 2004

  2. Content • 1. Motivation • 2. Problems of Polynom Interpolation • 3. Bézier Curves • 3.1 Bernstein Polynomials • 3.2 Definition of Bézier Curves • 3.3 Evaluation • 4. Summary Computer Aided Geometric Design Ferienakademie 2004

  3. Motivation (1/2) Target :better control over the curve’s shape Background: Computer-supported automobile and aircraft design Bézier(Renault) and de Casteljau (Citröen) both developed independent from each other around 1960/65 descriptions of curves with the following attributes: • Substitutes of pattern drawings by CAD • Flexible manipulation of curves with guaranteed and controllable shape of the resulting curve • Introduction of control points that not necessarily lie itself on the curve Computer Aided Geometric Design Ferienakademie 2004

  4. Motivation (2/2) Typical applications are: • Car design, aircraft design, and ship design • Simulation of movements • Animations, movie industry and computer graphics Modelling of objects with free-form-surfaces Computer Aided Geometric Design Ferienakademie 2004

  5. Problems of Polynom Interpolation (1/2) • Polynom interpolation is an easy and unique method for describing curves that also contain some „nice“ geometrical attributes. • Polynom interpolation is not the method of choice within CAD applications due to better curve descriptions (as we will see later). Reason: polynom interpolation may oscillate Computer Aided Geometric Design Ferienakademie 2004

  6. Problems of Polynom Interpolation (2/2) Problems: • The polynomial interpolant may oscillate even when normal data points and paramter values are used. • The polynomial interpolant is not shape preserving. This has nothing to do with numerical effects, it‘s due to the interpolation process. • Too high costs for interpolation process: huge amount of necessary operations for constructing and evaluating the interpolant. Computer Aided Geometric Design Ferienakademie 2004

  7. Method of approximation: Bézier polynomials with binomial coefficients Bernstein Polynomials (1/2) • Preliminaries: Bernstein polynomials Def.: A Bernstein polynomial of grade n has the following description Computer Aided Geometric Design Ferienakademie 2004

  8. Proof: Bernstein Polynomials (2/2) Attributes of Bernstein polynomials: • i-times null in t=0, (n-i)-times null in t=1 Computer Aided Geometric Design Ferienakademie 2004

  9. Basis functions of Bernstein Polynomials Bernstein-Polynomevom Grad 4 Computer Aided Geometric Design Ferienakademie 2004

  10. b2 Control polygon b3 Bézier curve b1 b4 Bézier Curves (1/2) Def.: The following curve is called Bézier curve of grade n with control points b0,…,bn The complete form of a Bézier polynomial of grade 3, for example, with control points b0,…,bn looks as follows: Computer Aided Geometric Design Ferienakademie 2004

  11. Bézier Curves (2/2) Different Bézier Curves with its control polygons Computer Aided Geometric Design Ferienakademie 2004

  12. Attributes of Bézier Curves (1/9) Attributes of Bézier curves: • x(0)=b0 and x(1)=bn, that means the Bézier curve lies on b0 and bn. • x‘(0)=n(b1-b0) and x‘(1)=n(bn-bn-1) (tangents in start and end point) • Values x(t) are a convex combination of the control points • The Bézier curve entirely lies in its control polyeder or control polygon Computer Aided Geometric Design Ferienakademie 2004

  13. Attributes of Bézier curves (2/9) • Bézier curves are invariant under projections • Bézier curves are symmetric within their control points • Are all Bézier points collinear the Bézier curve becomes a line • Bézier curves are shape preserving: non negative (monoton, convex…) data leads to a non negative (monoton, convex…) curve Computer Aided Geometric Design Ferienakademie 2004

  14. control polygon line element line element Bézier curve Attributes of Bézier Curves (3/9) Endpoint interpolation and attributes of tangents: A Bézier curve interpolates the first and the last point of its control polygon and has the first and last line element of its control polygon as tangent. b0 bn Computer Aided Geometric Design Ferienakademie 2004

  15. Attributes of Bézier Curves (4/9) Convex hull property: A Bézier curve lies within the convex hull of its control polygon. Computer Aided Geometric Design Ferienakademie 2004

  16. 3 1 3 2 1 2 1 2 3 1 Attributes of Bézier Curves (5/9) Variation diminishing property: Given: Bézier curve, any kind of line or plane A Bézier curve doesn’t change the sides of any line or plane not more often as its control polygon. Sample lines Computer Aided Geometric Design Ferienakademie 2004

  17. Control polygon Bézier curve Attributes of Bézier Curves (6/9) Linear precision: Are the control points b0,...,bn of a Bézier curve collinear the Bézier curve itself becomes a line. bn b0 Computer Aided Geometric Design Ferienakademie 2004

  18. c2 c3 d1 d0 c1 d2 d3 c0 Attributes of Bézier Curves (7/9) Subdivision: Given is a Bézier curve with its control polygon (b0,...,bn) resp. [0,1]. Sometimes it’s necessary to cut a single Bézier curve into two parts, both together being identically to the originating curve. 1. The subdivision algorithm from de Casteljau leads to the control polygons (c0,...,cn) and (d0,...,dn) of the Bézier curves within the intervals [0,t] and [t,1], resp. b2 b1 b3 b0 Example: n=3 Computer Aided Geometric Design Ferienakademie 2004

  19. Attributes of Bézier Curves (8/9) b2 b1 Subdivision: Given is a Bézier curve with its control polygon (b0,...,bn) 2. Successively subdivision with de Casteljau’s algorithm leads to a series of polygons fast converging to the curve. b3 b0 Computer Aided Geometric Design Ferienakademie 2004

  20. Attributes of Bézier Curves (9/9) Subdivision: Given is a Bézier curve with its control polygon (b0,...,bn) 3. Cutting off edges doesn’t lead to further changes of sides.  Variation diminishing property b2 b1 b3 b0 Computer Aided Geometric Design Ferienakademie 2004

  21. Increase of Grade of Bézier curves (1/2) • Problem: After a Bézier polygon has been modified several times, it can be seen that the curve of grade n is not flexible enough to represent the desired shape. • Idea: Add one edge without changing the current shape of the curve. • Solution: Increase the grade of the Bézier curve from n to n+1, thus, the new Bézier points Bk can be determined from the old Bézier points bi as follows: Computer Aided Geometric Design Ferienakademie 2004

  22. Increase of Grade of Bézier Curves (2/2) Application: • Design of surfaces • Data exchange between different CAD and graphic systems Increase of grade: both polygons describe the same (cubic) curve Computer Aided Geometric Design Ferienakademie 2004

  23. Evaluation of Bézier Curves Method for determination of single curve points, i.e. determination of x(t) for some t: • Recursive calculation of Bernstein polynomials • de Casteljau‘s algorithm Computer Aided Geometric Design Ferienakademie 2004

  24. Recursive Calculation Recursive calculation of Bernstein polynomials According to this definition Bézier curves are calculated with the help of Bernstein polynomials. Example of a cubic Bézier curve Computer Aided Geometric Design Ferienakademie 2004

  25. b11 b02 b12 b03 b01 b21 de Casteljau‘s Algorithm (1/2) Geometric construction according to de Casteljau‘s algorithm for n=3 and t=2/3 b1 b2 b3 0 t 1 b0 Computer Aided Geometric Design Ferienakademie 2004

  26. de Casteljau‘s Algorithm (2/2) de Casteljau‘s algorithm i=0,…,n: It can be described with the following scheme: k=1,…,n: i=k,…,n: This leads to Computer Aided Geometric Design Ferienakademie 2004

  27. Example: De Casteljau‘s Algorithm (1/2) • Given: Bézier curve of grade 4 • With Bézier points • Wanted for Computer Aided Geometric Design Ferienakademie 2004

  28. Example: de Casteljau‘s Algorithm (2/2) de Casteljau scheme for the x-component 1 0 0.4 1 0.6 0.52 6 4.0 2.64 1.8 7.5 6.9 5.74 4.5 3.42 = x(t=0.6) de Casteljau scheme for the y-component 0 2 1.2 5.5 4.1 2.9 5.5 5.5 4.9 4.14 0.5 6.7 3.6 4.9 4.174 = y(t=0.6) Resultat: X(t=0.6)=(x,y)=(3.42,4.174) Computer Aided Geometric Design Ferienakademie 2004

  29. Rating of Bézier Curves (1/2) Rating of Bézier curves according to controlability and locality: Local changes of control points have global effects, but their influence is only of local interest: The change is only significant within the scope of the control point . Computer Aided Geometric Design Ferienakademie 2004

  30. Rating of Bézier Curves (2/2) Problems: • Double points are possible, i.e. the projection is not bijetive • Complex shapes of the desired curves may result in a huge amount of control points that again leads to a high ploynom grade. Computer Aided Geometric Design Ferienakademie 2004

  31. B-Splines NURBS Further Freeform Curves Computer Aided Geometric Design Ferienakademie 2004

  32. Freeform Surfaces Bézier surface Computer Aided Geometric Design Ferienakademie 2004

  33. End

More Related