For our simpler case it can produce "Constrained Delaunay which means no extraneous triangles.
Tested it on my own data, it worked very well. .
Panda3d A huge, free software stack used by Disney's VR group, which includes triangulation adapted from "Narkhede.Here are each of the options i found.Perhaps it did back in 2001, but as of 2007, it contains code to call "Triangle". .See the evaluation.2 (no longer active).From: Sébastien Berthet mailto: Sent: Friday, February 01, 2008 12:56 AM I assume that you used the last version on CVS (commited 3 weeks ago right?I also spent 3 hours trying to build Panda itself (with most dependencies including Python disabled.) No luck, it is just too complex.The algorithm seems to regard this as degenerate (and does not even detect it to avoid crashing) but it is unfortunately a commonly encountered shape.JTS is a very large package (as is its C sibling, geos ) but if you are already using it, then this might be an option.Triangle triangulate the hole, then does some kind of "flood fill" to empty. .In 2008.01, i adapted the Triangle code with a wrapper win money free online games to call it from vtlib. .SGI OpenGL Sample Implementation one developer has done this, and says "It was very easy which seems rather surprising!I evaluated. .Add it to vtdata.Set: test densetest sparsetraining densetraining sparse, metric: bad.5 bad.0 bad.0 bad.0 avgerr rms A50 A90 A95 online contest india win prizes A99 time time/MP time/GD.Efficient Polygon Triangulation, by John.Uses STL, but this dependency was easy to remove.However, there are some (rare) cases of degenerate geometry where it will crash. .GPC does clipping and boolean operations in addition to triangulation problem: reportedly "uses a simple trapezoidal decomposition that introduces lots of t-junctions" problem: prohibitive license restricts usage "Triangle" by, jonathan Shewchuk, can produce Delaunay triangulations, which apparently have desirable traits for some purposes, but are.Poly2Tri (Liang / Kittelman, 2005 ) "Subdivision using monotone polygons and a sweep line algorithm, O(n log n) time and O(n) storage" Supports holes, makes a lot of very skinny triangles.