Bezier Curves Explained: Linear, Quadratic, and Cubic

Added:

Curve Basics
Cubic Curves

Curve Basics

0:00
Playing Section
  • 1

    Explains Bezier curves using control points for smooth scalable paths.

  • 2

    Covers linear interpolation as the foundation for curve construction.

The concept of linear interpolation (LERP) and how to calculate a point between two coordinates.
Parametric equations, specifically understanding how a curve can be defined using a parameter (usually 't' ranging from 0 to 1).
Basic vector algebra, including vector addition, subtraction, and scalar multiplication.
Fundamental polynomial algebra, specifically expanding and manipulating quadratic and cubic equations.
De Casteljau's algorithm, the recursive geometric method used to evaluate and subdivide Bezier curves.
Spline continuity conditions (C0, C1, C2 and G0, G1, G2 geometric continuity) for smoothly joining multiple Bezier curves together.
B-Splines and Non-Uniform Rational B-Splines (NURBS), which generalize Bezier curves for advanced 3D modeling.
Practical applications in computer graphics and design, such as vector font rendering, SVG path generation, and camera path interpolation in game engines.
247K views7.8Klikes3:04@GuidevOriginal Release: 2018-03-22

Bézier curves are smooth, scalable curves defined by control points where the curve always passes through the first and last control points; linear Bézier curves use two points with linear interpolation, quadratic curves use three points by interpolating between two linear interpolations, and cubic curves use four points by interpolating between two quadratic curves, creating increasingly complex smooth paths.