Triangle fan

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Set of connected triangles described by vertices A through F.

A triangle fan is a primitive in 3D computer graphics that saves on storage and processing time. It describes a set of connected triangles that share one central vertex (unlike the triangle strip that connects the next vertex point to the last two used vertices to form a triangle). If N is the number of triangles in the fan, the number of vertices describing it is N+2. This is a considerable improvement over the 3N vertices that are necessary to describe the triangles separately. The graphics pipeline can take advantage by only performing the viewing transformations and lighting calculations once per vertex.

Any convex polygon may be triangulated as a single fan, by arbitrarily selecting any point inside it as the center.

See also[edit]