Ray Tracing Acceleration Algorithm Based on FaceMap

Algorithm 3

Filling algorithm of the curve triangle.

	Input: All point information of curve triangle
	(1) Find the highest and lowest points of the triangle;
	(2) Traverse from the highest point to the lowest point:
	(a) Traverse from the highest point to the lowest point: Calculate all intersection points of the current line and the triangle edge;
	(b) For every two intersect points: Fill from the left node to the right node;
	Output: Results after filling