TRIANGLE RECURSIF

/*
tout l algo se trouve dans cette portion de code :
*/

void Triangle (point A, point B, point C)
{
// 0xFFFFFFFF = blanc en hexa
	line (A.x, A.y, B.x, B.y, 0xFFFFFFFF );
	line (A.x, A.y, C.x, C.y, 0xFFFFFFFF );
	line (B.x, B.y, C.x, C.y, 0xFFFFFFFF );
}
// recupere le milieu de 2 points
point midpoint (point a, point b)
{
	static point tmp;
	tmp.x = (a.x + b .x )*.5;
	tmp.y = (a.y + b .y )*.5;
	return tmp;
}
// dessine la forme fractale a un certain niveau de profondeur
void recurTri (point A, point B, point C, int level)
{
	if (level > 0)
	{
		recurTri( A, midpoint(A,B), midpoint(A,C),level -1);
		recurTri( B, midpoint(B,A), midpoint(B,C),level -1);
		recurTri( C, midpoint(C,A), midpoint(C,B),level -1);
	}
	else
		Triangle ( A, B, C );
}