Triangulation of 2D shapes about ogre-procedural HOT 10 CLOSED

[deleted comment]

[deleted comment]

Finally decided to use an easier to implement algorithm, based on point 
insertion.
Here is a description of this algorithm : 
http://www.cg.tuwien.ac.at/hostings/cescg/CESCG-2004/web/Domiter-Vid/

I finished implementing Delaunay triangulation, debugging it right now.
Will add Constrained Delaunay as soon as Delaunay algo is bug free..

[deleted comment]

Hey mate,

I've successfully done this before using the ear cutting algorithm. There's a 
great explanation and interactive demo of the algorithm here: 
http://cgm.cs.mcgill.ca/~godfried/teaching/cg-projects/97/Ian/applet1.html

I hope that helps.

Ok, great!
I've already made some progress with Delaunay triangulation, but I still need 
to add constraints and debug everything.
If I get stuck (again!) implementing CDT, I'll try your algorithm...

[deleted comment]

[deleted comment]

What the code does already :
- Produce delaunay triangulation from the points
- Exclude triangle that are outside of the shape
What it does not do yet :
- Split and re-triangulate delaunay triangles intersected by a shape segment