In this paper, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray-tracing algorithm. ZF-buffer is a combination of Z-buffer and face-buffer (F-buffer). ZF-buffer is used in the preprocessing of ray tracing and records t...
In this paper, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray-tracing algorithm. ZF-buffer is a combination of Z-buffer and face-buffer (F-buffer). ZF-buffer is used in the preprocessing of ray tracing and records the pointer that points to a parent face of a depth value (z value) of an object determined in Z-buffer. As a result, the face that intersects with the primary ray can be determined easily by using the pointer stored in F-buffer. Though ZF-buffer and vista-buffer resemble each other, there is the difference between the two methods; ZF-buffer records not bounding volume but the pointer of a displayable face. We applied the ZF-buffer algorithm for the primary ray to Utah teapot that consists of 9216 polygons. By comparing the elapse time of our method with that of vista-buffer algorithm, we have showed improvement in speed that it is 3 times faster than vista-buffer algorithm. We expanded our algorithm to the secondary ray.