Bézier curve

Specific cases

A Bézier curve is defined by a sequence of control points P₀ through P_n, where n is called the order of the curve (n = 1 for linear, 2 for quadratic, 3 for cubic, etc.). The first and last control points are always the endpoints of the curve; however, the intermediate control points generally do not lie on the curve. The sums in the following sections are to be understood as affine combinations – that is, the coefficients sum to 1.

Linear Bézier curves

Given distinct points P₀ and P₁, a linear Bézier curve is simply a line between those two points. The curve is given by

${\displaystyle \mathbf{B}(t)={\mathbf{P}}_0+t({\mathbf{P}}_1-{\mathbf{P}}_0)=(1-t){\mathbf{P}}_0+t{\mathbf{P}}_1,0\le t\le 1}$

This is the simplest and is equivalent to linear interpolation. The quantity ${\displaystyle {\mathbf{P}}_1-{\mathbf{P}}_0}$ represents the displacement vector from the start point to the end point.

Quadratic Bézier curves

A quadratic Bézier curve is the path traced by the function B(t), given points P₀, P₁, and P₂,

${\displaystyle \mathbf{B}(t)=(1-t)[(1-t){\mathbf{P}}_0+t{\mathbf{P}}_1]+t[(1-t){\mathbf{P}}_1+t{\mathbf{P}}_2],0\le t\le 1}$,

which can be interpreted as the linear interpolant of corresponding points on the linear Bézier curves from P₀ to P₁ and from P₁ to P₂ respectively. Rearranging the preceding equation yields:

${\displaystyle \mathbf{B}(t)=(1-t{)}^2{\mathbf{P}}_0+2(1-t)t{\mathbf{P}}_1+t^2{\mathbf{P}}_2,0\le t\le 1.}$

This can be written in a way that highlights the symmetry with respect to P₁:

${\displaystyle \mathbf{B}(t)={\mathbf{P}}_1+(1-t{)}^2({\mathbf{P}}_0-{\mathbf{P}}_1)+t^2({\mathbf{P}}_2-{\mathbf{P}}_1),0\le t\le 1.}$

Which immediately gives the derivative of the Bézier curve with respect to t:

${\displaystyle {\mathbf{B}}^{\prime }(t)=2(1-t)({\mathbf{P}}_1-{\mathbf{P}}_0)+2t({\mathbf{P}}_2-{\mathbf{P}}_1),}$

from which it can be concluded that the tangents to the curve at P₀ and P₂ intersect at P₁. As t increases from 0 to 1, the curve departs from P₀ in the direction of P₁, then bends to arrive at P₂ from the direction of P₁.

The second derivative of the Bézier curve with respect to t is

${\displaystyle {\mathbf{B}}^{″}(t)=2({\mathbf{P}}_2-2{\mathbf{P}}_1+{\mathbf{P}}_0).}$

Cubic Bézier curves

Four points P₀, P₁, P₂ and P₃ in the plane or in higher-dimensional space define a cubic Bézier curve. The curve starts at P₀ going toward P₁ and arrives at P₃ coming from the direction of P₂. Usually, it will not pass through P₁ or P₂; these points are only there to provide directional information. The distance between P₁ and P₂ determines "how far" and "how fast" the curve moves towards P₁ before turning towards P₂.

Writing B_Pi,Pj,Pk(t) for the quadratic Bézier curve defined by points P_i, P_j, and P_k, the cubic Bézier curve can be defined as an affine combination of two quadratic Bézier curves:

${\displaystyle \mathbf{B}(t)=(1-t){\mathbf{B}}_{{\mathbf{P}}_0,{\mathbf{P}}_1,{\mathbf{P}}_2}(t)+t{\mathbf{B}}_{{\mathbf{P}}_1,{\mathbf{P}}_2,{\mathbf{P}}_3}(t),0\le t\le 1.}$

The explicit form of the curve is:

${\displaystyle \mathbf{B}(t)=(1-t{)}^3{\mathbf{P}}_0+3(1-t{)}^{2}t{\mathbf{P}}_1+3(1-t)t^2{\mathbf{P}}_2+t^3{\mathbf{P}}_3,0\le t\le 1.}$

For some choices of P₁ and P₂ the curve may intersect itself or contain a cusp.

Any series of 4 distinct points can be converted to a cubic Bézier curve that goes through all 4 points in order. Given the starting and ending point of some cubic Bézier curve, and the points along the curve corresponding to t = 1/3 and t = 2/3, the control points for the original Bézier curve can be recovered.

The derivative of the cubic Bézier curve with respect to t is

${\displaystyle {\mathbf{B}}^{\prime }(t)=3(1-t{)}^2({\mathbf{P}}_1-{\mathbf{P}}_0)+6(1-t)t({\mathbf{P}}_2-{\mathbf{P}}_1)+3t^2({\mathbf{P}}_3-{\mathbf{P}}_2).}$

The second derivative of the Bézier curve with respect to t is

${\displaystyle {\mathbf{B}}^{″}(t)=6(1-t)({\mathbf{P}}_2-2{\mathbf{P}}_1+{\mathbf{P}}_0)+6t({\mathbf{P}}_3-2{\mathbf{P}}_2+{\mathbf{P}}_1).}$

For control points whose consecutive triples form two similar triangles with the same orientation, the resulting cubic Bézier curve is an arc of a (scaled and translated) Tschirnhausen cubic. These are Pythagorean hodograph curves, curves whose arc length and offset curves have a rational parameterization, and they are the only cubic curves with these properties.

General definition

Bézier curves can be defined for any degree n.

Recursive definition

A recursive definition for the Bézier curve of degree n expresses it as a point-to-point linear combination (linear interpolation) of a pair of corresponding points in two Bézier curves of degree n − 1.

Let ${\displaystyle {\mathbf{B}}_{{\mathbf{P}}_0{\mathbf{P}}_1\dots {\mathbf{P}}_k}}$ denote the Bézier curve determined by any selection of points P₀, P₁, ..., P_k. Then to start,

${\displaystyle {\mathbf{B}}_{{\mathbf{P}}_0}(t)={\mathbf{P}}_0\text{, and}}$

${\displaystyle \mathbf{B}(t)={\mathbf{B}}_{{\mathbf{P}}_0{\mathbf{P}}_1\dots {\mathbf{P}}_n}(t)=(1-t){\mathbf{B}}_{{\mathbf{P}}_0{\mathbf{P}}_1\dots {\mathbf{P}}_{n-1}}(t)+t{\mathbf{B}}_{{\mathbf{P}}_1{\mathbf{P}}_2\dots {\mathbf{P}}_n}(t)}$

This recursion is elucidated in the animations below.

Explicit definition

The formula can be expressed explicitly as follows (where t⁰ and (1-t)⁰ are extended continuously to be 1 throughout [0,1]):

${\displaystyle \begin{array}{cc}\mathbf{B}(t)& =\sum _{i=0}^n(\genfrac{}{}{0ex}{}{n}{i})(1-t{)}^{n-i}{t}^i{\mathbf{P}}_i\\ & =(1-t{)}^n{\mathbf{P}}_0+(\genfrac{}{}{0ex}{}{n}{1})(1-t{)}^{n-1}t{\mathbf{P}}_1+\cdots +(\genfrac{}{}{0ex}{}{n}{n-1})(1-t)t^{n-1}{\mathbf{P}}_{n-1}+t^n{\mathbf{P}}_n,& & 0⩽t⩽1\end{array}}$

where ${\displaystyle (\genfrac{}{}{0ex}{}{n}{i})}$ are the binomial coefficients.

For example, when n = 5:

${\displaystyle \begin{array}{cccc}\mathbf{B}(t)& =(1-t{)}^5{\mathbf{P}}_0+5t(1-t{)}^4{\mathbf{P}}_1+10t^2(1-t{)}^3{\mathbf{P}}_2+10t^3(1-t{)}^2{\mathbf{P}}_3+5t^4(1-t){\mathbf{P}}_4+t^5{\mathbf{P}}_5,& & 0⩽t⩽1.\end{array}}$

Terminology

Some terminology is associated with these parametric curves. We have

${\displaystyle \mathbf{B}(t)=\sum _{i=0}^n{b}_{i,n}(t){\mathbf{P}}_i,0\le t\le 1}$

where the polynomials

${\displaystyle b_{i,n}(t)=(\genfrac{}{}{0ex}{}{n}{i})t^i(1-t{)}^{n-i},i=0,\dots ,n}$

are known as Bernstein basis polynomials of degree n.

t⁰ = 1, (1 − t)⁰ = 1, and the binomial coefficient, ${\displaystyle (\genfrac{}{}{0ex}{}{n}{i})}$, is:

${\displaystyle (\genfrac{}{}{0ex}{}{n}{i})=\frac{n!}{i!(n-i)!}.}$

The points P_i are called control points for the Bézier curve. The polygon formed by connecting the Bézier points with lines, starting with P₀ and finishing with P_n, is called the Bézier polygon (or control polygon). The convex hull of the Bézier polygon contains the Bézier curve.

Polynomial form

Sometimes it is desirable to express the Bézier curve as a polynomial instead of a sum of less straightforward Bernstein polynomials. Application of the binomial theorem to the definition of the curve followed by some rearrangement will yield

${\displaystyle \mathbf{B}(t)=\sum _{j=0}^n{t}^j{\mathbf{C}}_j}$

where

${\displaystyle {\mathbf{C}}_j=\frac{n!}{(n-j)!}\sum _{i=0}^j\frac{(-1{)}^{i+j}{\mathbf{P}}_i}{i!(j-i)!}=\prod _{m=0}^{j-1}(n-m)\sum _{i=0}^j\frac{(-1{)}^{i+j}{\mathbf{P}}_i}{i!(j-i)!}.}$

This could be practical if ${\displaystyle {\mathbf{C}}_j}$ can be computed prior to many evaluations of ${\displaystyle \mathbf{B}(t)}$; however one should use caution as high order curves may lack numeric stability (de Casteljau's algorithm should be used if this occurs). Note that the empty product is 1.

Properties

• The curve begins at ${\displaystyle {\mathbf{P}}_0}$ and ends at ${\displaystyle {\mathbf{P}}_n}$; this is the so-called endpoint interpolation property.
• The curve is a line if and only if all the control points are collinear.
• The start and end of the curve is tangent to the first and last section of the Bézier polygon, respectively.
• A curve can be split at any point into two subcurves, or into arbitrarily many subcurves, each of which is also a Bézier curve.
• Some curves that seem simple, such as the circle, cannot be described exactly by a Bézier or piecewise Bézier curve; though a four-piece cubic Bézier curve can approximate a circle (see composite Bézier curve), with a maximum radial error of less than one part in a thousand, when each inner control point (or offline point) is the distance ${\displaystyle \frac{4\left(\sqrt{2}-1\right)}{3}}$ horizontally or vertically from an outer control point on a unit circle. More generally, an n-piece cubic Bézier curve can approximate a circle, when each inner control point is the distance ${\displaystyle \frac{4}{3}\tan (t/4)}$ from an outer control point on a unit circle, where $t=2\pi /n$ (i.e. ${\displaystyle t={360}^{\circ }/n}$), and ${\displaystyle n>2}$.
• Every quadratic Bézier curve is also a cubic Bézier curve, and more generally, every degree n Bézier curve is also a degree m curve for any m > n. In detail, a degree n curve with control points ${\displaystyle {\mathbf{P}}_0,\dots ,{\mathbf{P}}_n}$ is equivalent (including the parametrization) to the degree n + 1 curve with control points ${\displaystyle {\mathbf{P}}_0^{\prime },\dots ,{\mathbf{P}}_{n+1}^{\prime }}$, where ${\displaystyle {\mathbf{P}}_k^{\prime }=\frac{k}{n+1}{\mathbf{P}}_{k-1}+\left(1-\frac{k}{n+1}\right){\mathbf{P}}_k}$, ${\displaystyle \mathrm{\forall }k=0,1,\dots ,n,n+1}$ and define ${\displaystyle {\mathbf{P}}_{n+1}:={\mathbf{P}}_0}$, ${\displaystyle {\mathbf{P}}_{-1}:={\mathbf{P}}_n}$.
• Bézier curves have the variation diminishing property. What this means in intuitive terms is that a Bézier curve does not "undulate" more than the polygon of its control points, and may actually "undulate" less than that.
• There is no local control in degree n Bézier curves—meaning that any change to a control point requires recalculation of and thus affects the aspect of the entire curve, "although the further that one is from the control point that was changed, the smaller is the change in the curve".
• A Bézier curve of order higher than two may intersect itself or have a cusp for certain choices of the control points.

Second-order curve is a parabolic segment

A quadratic Bézier curve is also a segment of a parabola. As a parabola is a conic section, some sources refer to quadratic Béziers as "conic arcs". With reference to the figure on the right, the important features of the parabola can be derived as follows:

1. Tangents to the parabola at the endpoints of the curve (A and B) intersect at its control point (C).
2. If D is the midpoint of AB, the tangent to the curve which is perpendicular to CD (dashed cyan line) defines its vertex (V). Its axis of symmetry (dash-dot cyan) passes through V and is perpendicular to the tangent.
3. E is either point on the curve with a tangent at 45° to CD (dashed green). If G is the intersection of this tangent and the axis, the line passing through G and perpendicular to CD is the directrix (solid green).
4. The focus (F) is at the intersection of the axis and a line passing through E and perpendicular to CD (dotted yellow). The latus rectum is the line segment within the curve (solid yellow).

Derivative

The derivative for a curve of order n is

${\displaystyle {\mathbf{B}}^{\prime }(t)=n\sum _{i=0}^{n-1}{b}_{i,n-1}(t)({\mathbf{P}}_{i+1}-{\mathbf{P}}_i).}$

Constructing Bézier curves

Linear curves

Let t denote the fraction of progress (from 0 to 1) the point B(t) has made along its traversal from P₀ to P₁. For example, when t=0.25, B(t) is one quarter of the way from point P₀ to P₁. As t varies from 0 to 1, B(t) draws a line from P₀ to P₁.

Quadratic curves

For quadratic Bézier curves one can construct intermediate points Q₀ and Q₁ such that as t varies from 0 to 1:

• Point Q₀(t) varies from P₀ to P₁ and describes a linear Bézier curve.
• Point Q₁(t) varies from P₁ to P₂ and describes a linear Bézier curve.
• Point B(t) is interpolated linearly between Q₀(t) to Q₁(t) and describes a quadratic Bézier curve.

Higher-order curves

For higher-order curves one needs correspondingly more intermediate points. For cubic curves one can construct intermediate points Q₀, Q₁, and Q₂ that describe linear Bézier curves, and points R₀ and R₁ that describe quadratic Bézier curves:

For fourth-order curves one can construct intermediate points Q₀, Q₁, Q₂ and Q₃ that describe linear Bézier curves, points R₀, R₁ and R₂ that describe quadratic Bézier curves, and points S₀ and S₁ that describe cubic Bézier curves:

For fifth-order curves, one can construct similar intermediate points.

These representations rest on the process used in De Casteljau's algorithm to calculate Bézier curves.

Offsets (or stroking) of Bézier curves

The curve at a fixed offset from a given Bézier curve, called an offset or parallel curve in mathematics (lying "parallel" to the original curve, like the offset between rails in a railroad track), cannot be exactly formed by a Bézier curve (except in some trivial cases). In general, the two-sided offset curve of a cubic Bézier is a 10th-order algebraic curve and more generally for a Bézier of degree n the two-sided offset curve is an algebraic curve of degree 4n − 2. However, there are heuristic methods that usually give an adequate approximation for practical purposes.

In the field of vector graphics, painting two symmetrically distanced offset curves is called stroking (the Bézier curve or in general a path of several Bézier segments). The conversion from offset curves to filled Bézier contours is of practical importance in converting fonts defined in Metafont, which require stroking of Bézier curves, to the more widely used PostScript type 1 fonts, which only require (for efficiency purposes) the mathematically simpler operation of filling a contour defined by (non-self-intersecting) Bézier curves.

Degree elevation

A Bézier curve of degree n can be converted into a Bézier curve of degree n + 1 with the same shape. This is useful if software supports Bézier curves only of specific degree. For example, systems that can only work with cubic Bézier curves can implicitly work with quadratic curves by using their equivalent cubic representation.

To do degree elevation, we use the equality ${\displaystyle \mathbf{B}(t)=(1-t)\mathbf{B}(t)+t\mathbf{B}(t).}$ Each component ${\displaystyle {\mathbf{b}}_{i,n}(t){\mathbf{P}}_i}$ is multiplied by (1 − t) and t, thus increasing a degree by one, without changing the value. Here is the example of increasing degree from 2 to 3.

${\displaystyle \begin{array}{cc}(1-t{)}^2{\mathbf{P}}_0+2(1-t)t{\mathbf{P}}_1+t^2{\mathbf{P}}_2& =(1-t{)}^3{\mathbf{P}}_0+2(1-t{)}^{2}t{\mathbf{P}}_1+(1-t)t^2{\mathbf{P}}_2+(1-t{)}^{2}t{\mathbf{P}}_0+2(1-t)t^2{\mathbf{P}}_1+t^3{\mathbf{P}}_2\\ & =(1-t{)}^3{\mathbf{P}}_0+(1-t{)}^{2}t\left({\mathbf{P}}_0+2{\mathbf{P}}_1\right)+(1-t)t^2\left(2{\mathbf{P}}_1+{\mathbf{P}}_2\right)+t^3{\mathbf{P}}_2\\ & =(1-t{)}^3{\mathbf{P}}_0+3(1-t{)}^{2}t\frac{1}{3}\left({\mathbf{P}}_0+2{\mathbf{P}}_1\right)+3(1-t)t^2\frac{1}{3}\left(2{\mathbf{P}}_1+{\mathbf{P}}_2\right)+t^3{\mathbf{P}}_2\end{array}}$

In other words, the original start and end points are unchanged. The new control points are ${\displaystyle {{\mathbf{P}}^{\prime }}_1=\frac{1}{3}\left({\mathbf{P}}_0+2{\mathbf{P}}_1\right)}$ and ${\displaystyle {{\mathbf{P}}^{\prime }}_2=\frac{1}{3}\left(2{\mathbf{P}}_1+{\mathbf{P}}_2\right)}$.

For arbitrary n we use equalities

${\displaystyle \{\begin{array}{l}(\genfrac{}{}{0ex}{}{n+1}{i})(1-t){\mathbf{b}}_{i,n}=(\genfrac{}{}{0ex}{}{n}{i}){\mathbf{b}}_{i,n+1}\\ (\genfrac{}{}{0ex}{}{n+1}{i+1})t{\mathbf{b}}_{i,n}=(\genfrac{}{}{0ex}{}{n}{i}){\mathbf{b}}_{i+1,n+1}\end{array}⟹\{\begin{array}{l}(1-t){\mathbf{b}}_{i,n}=\frac{n+1-i}{n+1}{\mathbf{b}}_{i,n+1}\\ t{\mathbf{b}}_{i,n}=\frac{i+1}{n+1}{\mathbf{b}}_{i+1,n+1}\end{array}}$

Therefore:

${\displaystyle \begin{array}{cc}\mathbf{B}(t)& =(1-t)\sum _{i=0}^n{\mathbf{b}}_{i,n}(t){\mathbf{P}}_i+t\sum _{i=0}^n{\mathbf{b}}_{i,n}(t){\mathbf{P}}_i\\ & =\sum _{i=0}^n\frac{n+1-i}{n+1}{\mathbf{b}}_{i,n+1}(t){\mathbf{P}}_i+\sum _{i=0}^n\frac{i+1}{n+1}{\mathbf{b}}_{i+1,n+1}(t){\mathbf{P}}_i\\ & =\sum _{i=0}^{n+1}\left(\frac{i}{n+1}{\mathbf{P}}_{i-1}+\frac{n+1-i}{n+1}{\mathbf{P}}_i\right){\mathbf{b}}_{i,n+1}(t)\\ & =\sum _{i=0}^{n+1}{\mathbf{b}}_{i,n+1}(t){{\mathbf{P}}^{\prime }}_i\end{array}}$

introducing arbitrary ${\displaystyle {\mathbf{P}}_{-1}}$ and ${\displaystyle {\mathbf{P}}_{n+1}}$.

Therefore, new control points are

${\displaystyle {{\mathbf{P}}^{\prime }}_i=\frac{i}{n+1}{\mathbf{P}}_{i-1}+\frac{n+1-i}{n+1}{\mathbf{P}}_i,i=0,\dots ,n+1.}$

Repeated degree elevation

The concept of degree elevation can be repeated on a control polygon R to get a sequence of control polygons R, R₁, R₂, and so on. After r degree elevations, the polygon R_r has the vertices P_0,r, P_1,r, P_2,r, ..., P_n+r,r given by

${\displaystyle {\mathbf{P}}_{i,r}=\sum _{j=0}^n{\mathbf{P}}_j(\genfrac{}{}{0ex}{}{n}{j})\frac{(\genfrac{}{}{0ex}{}{r}{i-j})}{(\genfrac{}{}{0ex}{}{n+r}{i})}.}$

It can also be shown that for the underlying Bézier curve B,

${\displaystyle \underset{\mathbf{r}\to \mathrm{\infty }}{lim}{\mathbf{R}}_{\mathbf{r}}=\mathbf{B}.}$

Degree reduction

Degree reduction can only be done exactly when the curve in question is originally elevated from a lower degree. A number of approximation algorithms have been proposed and used in practice.

Rational Bézier curves

The rational Bézier curve adds adjustable weights to provide closer approximations to arbitrary shapes. The numerator is a weighted Bernstein-form Bézier curve and the denominator is a weighted sum of Bernstein polynomials. Rational Bézier curves can, among other uses, be used to represent segments of conic sections exactly, including circular arcs.

Given n + 1 control points P₀, ..., P_n, the rational Bézier curve can be described by

${\displaystyle \mathbf{B}(t)=\frac{\sum _{i=0}^n{b}_{i,n}(t){\mathbf{P}}_i{w}_i}{\sum _{i=0}^n{b}_{i,n}(t)w_i},}$

or simply

${\displaystyle \mathbf{B}(t)=\frac{\sum _{i=0}^n(\genfrac{}{}{0ex}{}{n}{i})t^i(1-t{)}^{n-i}{\mathbf{P}}_i{w}_i}{\sum _{i=0}^n(\genfrac{}{}{0ex}{}{n}{i})t^i(1-t{)}^{n-i}{w}_i}.}$

The expression can be extended by using number systems besides reals for the weights. In the complex plane the points {1}, {-1}, and {1} with weights {${\displaystyle i}$}, {1}, and {${\displaystyle -i}$} generate a full circle with radius one. For curves with points and weights on a circle, the weights can be scaled without changing the curve's shape. Scaling the central weight of the above curve by 1.35508 gives a more uniform parameterization.

Applications

Computer graphics

Bézier curves are widely used in computer graphics to model smooth curves. As the curve is completely contained in the convex hull of its control points, the points can be graphically displayed and used to manipulate the curve intuitively. Affine transformations such as translation and rotation can be applied on the curve by applying the respective transform on the control points of the curve.

Quadratic and cubic Bézier curves are most common. Higher degree curves are more computationally expensive to evaluate. When more complex shapes are needed, low order Bézier curves are patched together, producing a composite Bézier curve. A composite Bézier curve is commonly referred to as a "path" in vector graphics languages (like PostScript), vector graphics standards (like SVG) and vector graphics programs (like Artline, Timeworks Publisher, Adobe Illustrator, CorelDraw, Inkscape, and Allegro). In order to join Bézier curves into a composite Bézier curve without kinks, a property called G1 continuity suffices to force the control point at which two constituent Bézier curves meet to lie on the line defined by the two control points on either side.

The simplest method for scan converting (rasterizing) a Bézier curve is to evaluate it at many closely spaced points and scan convert the approximating sequence of line segments. However, this does not guarantee that the rasterized output looks sufficiently smooth, because the points may be spaced too far apart. Conversely it may generate too many points in areas where the curve is close to linear. A common adaptive method is recursive subdivision, in which a curve's control points are checked to see if the curve approximates a line to within a small tolerance. If not, the curve is subdivided parametrically into two segments, 0 ≤ t ≤ 0.5 and 0.5 ≤ t ≤ 1, and the same procedure is applied recursively to each half. There are also forward differencing methods, but great care must be taken to analyse error propagation.

Analytical methods where a Bézier is intersected with each scan line involve finding roots of cubic polynomials (for cubic Béziers) and dealing with multiple roots, so they are not often used in practice.

The rasterisation algorithm used in Metafont is based on discretising the curve, so that it is approximated by a sequence of "rook moves" that are purely vertical or purely horizontal, along the pixel boundaries. To that end, the plane is first split into eight 45° sectors (by the coordinate axes and the two lines ${\displaystyle y=\pm x}$), then the curve is decomposed into smaller segments such that the direction of a curve segment stays within one sector; since the curve velocity is a second degree polynomial, finding the ${\displaystyle t}$ values where it is parallel to one of these lines can be done by solving quadratic equations. Within each segment, either horizontal or vertical movement dominates, and the total number of steps in either direction can be read off from the endpoint coordinates; in for example the 0–45° sector horizontal movement to the right dominates, so it only remains to decide between which steps to the right the curve should make a step up.

There is also a modified curve form of Bresenham's line drawing algorithm by Zingl that performs this rasterization by subdividing the curve into rational pieces and calculating the error at each pixel location such that it either travels at a 45° angle or straight depending on compounding error as it iterates through the curve. This reduces the next step calculation to a series of integer additions and subtractions.

Animation

In animation applications, such as Adobe Flash and Synfig, Bézier curves are used to outline, for example, movement. Users outline the wanted path in Bézier curves, and the application creates the needed frames for the object to move along the path.

In 3D animation, Bézier curves are often used to define 3D paths as well as 2D curves for keyframe interpolation. Bézier curves are now very frequently used to control the animation easing in CSS, JavaScript, JavaFx and Flutter SDK.

Fonts

TrueType fonts use composite Bézier curves composed of quadratic Bézier curves. Other languages and imaging tools (such as PostScript, Asymptote, Metafont, and SVG) use composite Béziers composed of cubic Bézier curves for drawing curved shapes. OpenType fonts can use either kind of curve, depending on which font technology underlies the OpenType wrapper.

Font engines, like FreeType, draw the font's curves (and lines) on a pixellated surface using a process known as font rasterization. Typically font engines and vector graphics engines render Bézier curves by splitting them recursively up to the point where the curve is flat enough to be drawn as a series of linear or circular segments. The exact splitting algorithm is implementation dependent, only the flatness criteria must be respected to reach the necessary precision and to avoid non-monotonic local changes of curvature. The "smooth curve" feature of charts in Microsoft Excel also uses this algorithm.

Because arcs of circles and ellipses cannot be exactly represented by Bézier curves, they are first approximated by Bézier curves, which are in turn approximated by arcs of circles. This is inefficient as there exists also approximations of all Bézier curves using arcs of circles or ellipses, which can be rendered incrementally with arbitrary precision. Another approach, used by modern hardware graphics adapters with accelerated geometry, can convert exactly all Bézier and conic curves (or surfaces) into NURBS, that can be rendered incrementally without first splitting the curve recursively to reach the necessary flatness condition. This approach also preserves the curve definition under all linear or perspective 2D and 3D transforms and projections.

Robotics

Because the control polygon allows to tell whether or not the path collides with any obstacles, Bézier curves are used in producing trajectories of the end effectors. Furthermore, joint space trajectories can be accurately differentiated using Bézier curves. Consequently, the derivatives of joint space trajectories are used in the calculation of the dynamics and control effort (torque profiles) of the robotic manipulator.