Fan triangulation explained

In computational geometry, a fan triangulation is a simple way to triangulate a polygon by choosing a vertex and drawing edges to all of the other vertices of the polygon. Not every polygon can be triangulated this way, so this method is usually only used for convex polygons.[1]

Properties

Aside from the properties of all triangulations, fan triangulations have the following properties:

n

vertices uses

n-3

diagonals, and generates

n-2

triangles.[2]

See also

Notes and References

  1. Book: Loera . Jesus . Rambau. Joerg. Santos. Francisco. Triangulations: Structures for Algorithms and Applications. limited . 2010 . Springer Science & Business Media . 9783642129711 . 103 .
  2. Book: O'Rourke, Joseph . Computational geometry in C . 1998 . Cambridge University Press . 9780521649766 . 2nd . Cambridge, UK . 38542796.
  3. Web site: The OpenGL Graphics System: A Specification . Segal. Mark. 24 October 2016. 2 March 2017.