Triangulation by Ear Clipping

@inproceedings{Eberly2005TriangulationBE,
  title={Triangulation by Ear Clipping},
  author={David Eberly},
  year={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
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Polygons have ears

  • G. H. Meisters
  • Amer. Math. Monthly, vol. 82, pp. 648–651
  • 1975
1 Excerpt

Similar Papers

Loading similar papers…