Anyone knows how to convert a non-convex poly to 2 or more convex ones?

[relsoft]

Thanks!

It doesn't have to be fast ;*)

[hellfire]

Check Ear clipping and Seidel's algorithm.
The complexity varies depending on whether you need to support holes and/or intersecting edges.
If you're using OpenGL you might want to have a look at the glu tesselation implementation, too.

[relsoft]

Thanks buddy, reading up on ear-clipping. ;*)