Fast Polygon Triangulation based on Seidel's Algorithm Atul Narkhede Dinesh Manocha Department of Computer Science, UNC Chapel Hill Getting the code Click here to get the C source. Introduction Computing the triangulation of a polygon is a fundamental algorithm in computational geometry. In computer graphics, polygon triangulation algorithms are widely used for tessellating curved geometries, as a