From Triangle tiles to convex Polygons.

This might properly belong in a computational geometry group, but
trying my chances here as well:

I start out with a complicated non-convex polygon with holes. I feed
it into OpenGL GLU, and I get back a few hundred triangles that
completely and exactly tile the original non-convex polygon. The
problem is that a few hundred triangles is way too many, and it is
preferred that the output is in "a list of tiled convex polygons". I
found this paper where the author claims to do what they are doing.
http://www.inf.u-szeged.hu/~boglarka/decpol.ps.gz

The issue that I have with it is that I found it to be highly symbolic/
mathematical (not my strongest language), and it would take me a while
to code it up and get it right. Is anyone aware of a library
implementation floating there somewhere, or of an alternative simpler
method?
.