rem: BOOL CoplanarTriTri(const Point& n, const Point& v0, const Point& v1, const Point& v2, const Point& u0, const Point& u1, const Point& u2)
add: BOOL CoplanarTriTri(const IceMaths::Point& n, const IceMaths::Point& v0, const IceMaths::Point& v1, const IceMaths::Point& v2, const IceMaths::Point& u0, const IceMaths::Point& u1, const IceMaths::Point& u2)
context: BOOL CoplanarTriTri(const Point& n, const Point& v0, const Point& v1, const Point& v2, const Point& u0, const Point& u1, const Point& u2){	float A[3];	short i0,i1;	/* first project onto an axis-aligned plane, that maximizes the area */	/* of the triangles, compute indices: i0,i1. */	A[0] = fabsf(n[0]);	A[1] = fabsf(n[1]);	A[2] = fabsf(n[2]);	if(A[0]>A[1])	{		if(A[0]>A[2])		{			i0=1;      /* A[0] is greatest */			i1=2;		}		else		{			i0=0;      /* A[2] is greatest */			i1=1;		}	}	else   /* A[0]<=A[1] */	{		if(A[2]>A[1])		{			i0=0;      /* A[2] is greatest */			i1=1;		}		else		{			i0=0;      /* A[1] is greatest */			i1=2;		}	}	/* test all edges of triangle 1 against the edges of triangle 2 */	EDGE_AGAINST_TRI_EDGES(v0, v1, u0, u1, u2);	EDGE_AGAINST_TRI_EDGES(v1, v2, u0, u1, u2);	EDGE_AGAINST_TRI_EDGES(v2, v0, u0, u1, u2);	/* finally, test if tri1 is totally contained in tri2 or vice versa */	POINT_IN_TRI(v0, u0, u1, u2);	POINT_IN_TRI(u0, v0, v1, v2);	return FALSE;}