Highly Influenced

# Triangulation by Ear Clipping

@inproceedings{Eberly2005TriangulationBE, title={Triangulation by Ear Clipping}, author={David Eberly}, year={2005} }

- Published 2005

A classic problem in computer graphics is to decompose a simple polygon into a collection of triangles whose vertices are only those of the simple polygon. By definition, a simple polygon is an ordered sequence of n points, ~ V0 through ~ Vn−1. Consecutive vertices are connected by an edge 〈~ Vi, ~ Vi+1〉, 0 ≤ i ≤ n − 2, and an edge 〈~ Vn−1, ~ V0〉 connects the first and last points. Each vertex shares exactly two edges. The only place where edges are allowed to intersect are at the vertices. A… CONTINUE READING