Ah looking good.

Are you using a sweepline approach now, or something else? I'm very interested in this stuff, and i would like to know more about your implementation and progress.

I still see one little glitch in your second image. One edge is missing (check the middle top of the image). And i see that your polygon is not convex. There are alot of caves who's vertices could be connected to form new triangles. This is no immediate problem, but i still like to know more about your implementation so i might be able to help you with that.

Few day's ago, i implemented delaunay triangulation using the "incremental" approach. Check this page:

http://www.codeguru.com/cpp/cpp/algo...icle.php/c8901

I would like to know about other methods. I know there is a "Divide and conquer" method and maybe a sweepline method. Check the wikipedia page on delaunay triangulation.