Point-normal triangle
The curved point-normal triangle, in short PN triangle, is an interpolation algorithm to retrieve a cubic BΓ©zier triangle from the vertex coordinates of a regular flat triangle and normal vectors. The PN triangle retains the vertices of the flat triangle as well as the corresponding normals. For computer graphics applications, additionally a linear or quadratic interpolant of the normals is created to represent an incorrect but plausible normal when rendering and so giving the impression of smooth transitions between adjacent PN triangles.[1] The usage of the PN triangle enables the visualization of triangle based surfaces in a smoother shape at low cost in terms of rendering complexity and time.
Mathematical formulation
With information of the given vertex positions of a flat triangle and the according normal vectors at the vertices a cubic BΓ©zier triangle is constructed. In contrast to the notation of the BΓ©zier triangle page the nomenclature follows G. Farin (2002),[2] therefore we denote the 10 control points as with the positive indices holding the condition .
The first three control points are equal to the given vertices. Six control points related to the triangle edges, i.e. are computed asThis definition ensures that the original vertex normals are reproduced in the interpolated triangle.
Finally the internal control point is derived from the previously calculated control points as
An alternative interior control point was suggested in.[3]