1 / 43

Introduction Curve Modelling

Introduction Curve Modelling. Jack van Wijk TU Eindhoven. Overview curve modelling. Parametric curves Requirements Concepts Lagrangian interpolation Bézier curve B-spline Cubic splines. Parametric curves. t. p ( t ). p ’( t ). Tangent line to curve. t. s. q ( s ). p ( t ).

callum
Télécharger la présentation

Introduction Curve Modelling

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. Introduction Curve Modelling Jack van Wijk TU Eindhoven

  2. Overview curve modelling • Parametric curves • Requirements • Concepts • Lagrangian interpolation • Bézier curve • B-spline • Cubic splines

  3. Parametric curves t p(t) p’(t)

  4. Tangent line to curve t s q(s) p(t) p’(t)

  5. Example q(s) s p’(t) t p(t)

  6. Curve modelling • Problem: How to define a smooth curve? • Solution: • Specify a sequence of points pi , i = 1,…, N, (control-points); • Generate a smooth curve that interpolates or approximates these control-points.

  7. Requirements • Smooth • no discontinuities in direction and curvature; • Local control • Change of a point should have only local effect; • Intuitive and easy to use • no oscillations, variation diminishing • Approximate or interpolate?

  8. Parametric interpolation

  9. Linear interpolation of two points p1 p2 t

  10. Linear interpolation of N points p5 p4 p3 p1 p2 t 1 wi 0 1 2 3 4 5 t

  11. Linear interpolation • Not Smooth • Local control • Intuitive and easy to use • Interpolate

  12. Lagrangian interpolation - 1

  13. Lagrangian interpolation - 2

  14. Lagrangian interpolation - 3

  15. Lagrangian interpolation - 4 • Smooth • no discontinuities in direction and curvature; • NO local control • Wild oscillations, not variation diminishing! • Interpolating

  16. Bézier curve - 1 • Puzzle: Define a smooth curve that interpolates the first and last point and approximates the others. p4 p3 p1 p2

  17. q1 q2 p(t) Bézier curve - 2 • Solution for N=3: p2 p1 p3

  18. p(t) Bézier curve - 3 • Solution for N=4: p2 p3 p1 p4

  19. Bézier curve - 4

  20. Bézier curve - 5

  21. Bézier curve - 6 General Bézier curve: • Degree = #points-1 • Smooth • no discontinuities in direction and curvature; • NO local control • Variation diminishing, convex hull property • Interpolates first and last, further approximating

  22. Convex hull property

  23. Convex hull property example Curve outside convex hull Curve inside convex hull

  24. B-splines • Piecewise polynomial, locally non-zero • Degree: user definable • Continuity: degree-1 • first degree: continuous in position • second degree: continuous in tangent • third degree: continuous in curvature

  25. Quadratic B-spline

  26. Cubic B-spline

  27. B-splines - 3 General B-spline: • Degree: from 1 to N-1 • Smooth (if degree > 1) • Local control • Variation diminishing, convex hull property • Approximating

  28. Cubic splines - 1 Most popular in Computer Graphics: • powerful • inflection points, continuity • simple • low degree polynomials • local control • Many versions: • Bézier, B-spline, Catmull-Rom,...

  29. Cubic splines - 2

  30. Cubic splines - 2

  31. Cubic splines - 3

  32. Tangent vector p’(t) p(t) t

  33. Significant values • p(0) : startpoint segment • p’(0) : tangent through startpoint • p(1) : endpoint segment • p’(1) : tangent through endpoint p’(0) p(1) t p’(1) p(0)

  34. Cubic Bézier curve p1 p2 p0 p3

  35. Joining two Bezier segments Positional continuity: p3= q0 Tangential continuity: p3- p2 // q1- q0 p1 p2 p3 q0 p0 q3 q1 q2

  36. Cubic B-spline curve p1 p2 p0 p3

  37. Conversion - 1

  38. Conversion - 2

  39. Puzzle 1: Hermite spline

  40. Puzzle 2: Limit on interpolation Find out why a curve that • interpolates the control points, • stays within the convex hull, • and is smooth cannot exist, both graphically and mathematically.

  41. Puzzle 3: Split Bezier curve • Find a recipe to split a cubic Bezier curve segment into two segments: p1 p2 q2 q3 q4 q1 q5 q6 p0 p3 q0

  42. Finally... • Curves: interpolation of points • Interpolation is generally applicable, f.i. surfaces: interpolation of curves • Demo program: www.win.tue.nl/~vanwijk/2M050/spline.exe

  43. B-splines - 2

More Related