$search
00001 #ifndef TRIANGULATE_H 00002 00003 #define TRIANGULATE_H 00004 00061 namespace ConvexDecomposition 00062 { 00063 00064 // all 3d triangles should be co-planer. Doesn't bother to check, you should have done that yourself to begin with! 00065 unsigned int triangulate3d(unsigned int pcount, // number of points in the polygon 00066 const double *vertices, // array of 3d vertices. 00067 double *triangles, // memory to store output triangles 00068 unsigned int maxTri, 00069 const double *plane); // maximum triangles we are allowed to output. 00070 00071 unsigned int triangulate3d(unsigned int pcount, // number of points in the polygon 00072 const unsigned int *indices, // polygon points using indices 00073 const double *vertices, // base address for array indexing 00074 double *triangles, // buffer to store output 3d triangles. 00075 unsigned int maxTri, 00076 const double *plane); // maximum triangles we can output. 00077 00078 unsigned int triangulate2d(unsigned int pcount, // number of points in the polygon 00079 const double *vertices, // address of input points (2d) 00080 double *triangles, // destination buffer for output triangles. 00081 unsigned int maxTri); // maximum number of triangles we can store. 00082 00083 }; 00084 00085 #endif