Redirected from Bezier triangle
& & & \ \ \boldsymbol{\beta\!^3}\ t^3 & & & \\
& & & & & & \\
& & +\ 3\boldsymbol{\alpha\!\beta\!^2}\ st^2 & & +\ 3\boldsymbol{\beta\!^2\!\gamma}\ t^2 u & & \\
& & & & & & \\
& +\ 3\boldsymbol{\alpha\!^2\!\beta}\ s^2 t & & +\ 6\boldsymbol{\alpha\!\beta\!\gamma}\ stu & & +\ 3\boldsymbol{\beta\!\gamma\!^2}\ tu^2 & \\
& & & & & & \\
+\ \boldsymbol{\alpha\!^3}\ s^3\ & & +\ 3\boldsymbol{\alpha\!^2\!\gamma}\ s^2 u & & +\ 3\boldsymbol{\alpha\!\gamma\!^2}\ su^2 & & +\ \boldsymbol{\gamma\!^3}\ u^3
\end{matrix}</math>
where α3, β3, γ3, α2β, αβ2, β2γ, βγ2, αγ2, α2γ and αβγ are the control points[?] of the triangle.
The corners of the triangle are the points α3, β3 and γ3. The edges of the triange are themselves Bézier curves, with the same control points as the bézier triangle.
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 less control points. With the exponent 1, 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.
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.
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.
| |||||||||||||||
| |||||||||||||||
|
See also: bézier curve, surface
|
Search Encyclopedia
|
Featured Article
|