Bézier triangle

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A Bézier triangle is a special type of Bézier surface, which is created by (linear, quadratic, cubic or higher degree) interpolation of control points.

Cubic Bézier triangle[edit]

An example Bézier triangle with control points marked

A cubic Bézier triangle is a surface with the equation

\begin{align}
p(s, t, u) = (\alpha s+\beta t+\gamma u)^3 =&
\beta^3\ t^3 + 3\ \alpha\beta^2\ st^2 + 3\ \beta^2\gamma\ t^2 u + \\
&3\ \alpha^2\beta\ s^2 t + 6\ \alpha\beta\gamma\ stu + 3\ \beta\gamma^2\ tu^2 + \\
&\alpha^3\ s^3+ 3\ \alpha^2\gamma\ s^2 u + 3\ \alpha\gamma^2\ su^2 + \gamma^3\ u^3
\end{align}

where α3, β3, γ3, α2β, αβ2, β2γ, βγ2, αγ2, α2γ and αβγ are the control points of the triangle and s, t, u (with 0 ≤ s, t, u ≤ 1 and s+t+u=1) the barycentric coordinates inside the triangle.[1] [2]

The corners of the triangle are the points α3, β3 and γ3. The edges of the triangle are themselves Bézier curves, with the same control points as the Bézier triangle.

By removing the γu term, a regular Bézier curve results. Also, while not very useful for display on a physical computer screen, by adding extra terms, a Bézier tetrahedron or Bézier polytope results.

Due to the nature of the equation, the entire triangle will be contained within the volume surrounded by the control points, and affine transformations of the control points will correctly transform the whole triangle in the same way.

Halving a cubic Bézier triangle[edit]

An advantage of Bézier triangles in computer graphics is, they are smooth, and can easily be approximated by regular triangles, by recursively dividing the Bézier triangle into two separate Bézier triangles, until they are considered sufficiently small, using only addition and division by two, not requiring any floating point arithmetic whatsoever.

The following computes the new control points for the half of the full Bézier triangle with the corner α3, a corner halfway along the Bézier curve between α3 and β3, and the third corner γ3.


\begin{pmatrix}
\boldsymbol{\alpha^3}{'}\\
\boldsymbol{\alpha^2\beta}{'}\\
\boldsymbol{\alpha\beta^2}{'}\\
\boldsymbol{\beta^3}{'}\\
\boldsymbol{\alpha^2\gamma}{'}\\
\boldsymbol{\alpha\beta\gamma}{'}\\
\boldsymbol{\beta^2\gamma}{'}\\
\boldsymbol{\alpha\gamma^2}{'}\\
\boldsymbol{\beta\gamma^2}{'}\\
\boldsymbol{\gamma^3}{'} 
\end{pmatrix}=\begin{pmatrix}
1&0&0&0&0&0&0&0&0&0\\
{1\over 2}&{1\over 2}&0&0&0&0&0&0&0&0\\
{1\over 4}&{2\over 4}&{1\over 4}&0&0&0&0&0&0&0\\
{1\over 8}&{3\over 8}&{3\over 8}&{1\over 8}&0&0&0&0&0&0\\
0&0&0&0&1&0&0&0&0&0\\
0&0&0&0&{1\over 2}&{1\over 2}&0&0&0&0\\
0&0&0&0&{1\over 4}&{2\over 4}&{1\over 4}&0&0&0\\
0&0&0&0&0&0&0&1&0&0\\
0&0&0&0&0&0&0&{1\over 2}&{1\over 2}&0\\
0&0&0&0&0&0&0&0&0&1
\end{pmatrix}\cdot\begin{pmatrix}
\boldsymbol{\alpha^3}\\
\boldsymbol{\alpha^2\beta}\\
\boldsymbol{\alpha\beta^2}\\
\boldsymbol{\beta^3}\\
\boldsymbol{\alpha^2\gamma}\\
\boldsymbol{\alpha\beta\gamma}\\
\boldsymbol{\beta^2\gamma}\\
\boldsymbol{\alpha\gamma^2}\\
\boldsymbol{\beta\gamma^2}\\
\boldsymbol{\gamma^3}
\end{pmatrix}
equivalently, using addition and division by two only,
        β3 := (αβ2 + β3)/2
    αβ2 := (α2β + αβ2)/2   β3 := (αβ2 + β3)/2
α2β := (α3 + α2β)/2   αβ2 := (α2β + αβ2)/2   β3 := (αβ2 + β3)/2
    β2γ := (αβγ + β2γ)/2
αβγ := (α2γ + αβγ)/2   β2γ:=(αβγ+β2γ)/2
βγ2 := (αγ2 + βγ2)/2
where := means to replace the vector on the left with the vector on the right.
Note that halving a bézier triangle is similar to halving Bézier curves of all orders up to the order of the Bézier triangle.

nth-order Bézier triangle[edit]

It is also possible to create quadratic or other degrees of Bézier triangles, by changing the exponent in the original equation, in which case there will be more or fewer control points. With the exponent 1 (one), the resulting Bézier triangle is actually a regular flat triangle. In all cases, the edges of the triangle will be Bézier curves of the same degree.

A general nth-order Bézier triangle has (n + 1)(n + 2)/2 control points a i β j γ k where ijk are nonnegative integers such that i + j + k = n. The surface is then defined as


(\alpha s + \beta t + \gamma u)^n 
= \sum_{\begin{smallmatrix} i+j+k=n \\ i,j,k \ge 0\end{smallmatrix}} {n \choose i\ j\ k } s^i t^j u^k \alpha^i \beta^j \gamma^k 
= \sum_{\begin{smallmatrix} i+j+k=n \\ i,j,k \ge 0\end{smallmatrix}} \frac{n!}{i!j!k!} s^i t^j u^k \alpha^i \beta^j \gamma^k

for all nonnegative real numbers s + t + u = 1.

See also[edit]

References[edit]

  1. ^ 3D Surface Rendering in Postscript 
  2. ^ Farin, Gerald (2002), Curves and surfaces for computer-aided geometric design (5 ed.), Academic Press Science & Technology Books, ISBN 978-1-55860-737-8 

External links[edit]