2 replies to this topic

[Jamie]

Hi all,

I'm looking for an existing library or algorithm for find the minimum number of convex polygon for a trimesh.

If you have some idea it could be cool
thanks.

[Nick]

Why do you need this, and what techniques have you already tried?

In general triangles are far easier to work with, and faster to process...

[Jamie]

I'm totally not agree with you, with triangle you have more polygon-edge by object. For software rendering or collision triangle is just slower that convex polygone. One advantage for triangle is to have constant mapping gradient, but if you have planar projection on convex polygon it's constant too, so i don't see advantage for triangle.