Polygon Triangulation
The problem here is to render an arbitrary polygon (concave or convex, open or closed) as a number of triangles. There are many applications, including in computer graphics itself, where it is important to deal only with triangles in rendering complex scenes.
References: O'Rourke, Joseph, Computational Geometry in C. (Cambridge University Press, 1994). DeBerg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O., Computational Geometry: Algorithms and Applications. Springer, 2000 (second edition).
References: O'Rourke, Joseph, Computational Geometry in C. (Cambridge University Press, 1994). DeBerg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O., Computational Geometry: Algorithms and Applications. Springer, 2000 (second edition).