Fast Polygon Triangulation

Started by
13 comments, last by ZQJ 18 years, 8 months ago
ZQJ: Thanks.. I'll look into ear clipping then. There's a good reason to generate a new vertex, and that is visual quality when interpolating colors/normals etc. One thing you can try is to create a convex polygon (based on a circle) with 20 vertices with different colors and try different triangulation methods. There's no way to get good quality interpolation here unless you generate a new vertex in the middle of the polygon!
Advertisement
Anybody else?
I've got some extremely fast code for tesselating polygons which are convex or concav. The main restriction is, it does not handle holes. The points have to be given in correct contour order:

CTriangulator.h
CTriangulator.cpp

It does not generate new vertices, just returns back an array of indices.

Y.
Thanks alot :)! which algorithm is it based on?
Looks like ear clipping to me.

This topic is closed to new replies.

Advertisement