This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Conference on Information Visualisation (IV'00)
A Study on the Ray-Tracing Acceleration Technique Based on the ZF-Buffer Algorithm
London, England
July 19-July 21
ISBN: 0-7695-0743-3
Sehyun Kim, Chung-Ang University
Sung-ye Kim, Chung-Ang University
Kyung-hyun Yoon, Chung-Ang University
In this work, we propose ZF-buffer algorithm in order to accelerate the intersection test of ray tracing. 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 first ray can be determined easily by using the pointer stored in F-buffer. Though ZF-buffer and vista-buffer resemble each other, the difference between the two methods is that what ZF-buffer records is not bounding volume but the pointer of a displayable face. We applied the ZF-buffer algorithm for the first ray to Utah teapot, which consists of 9216 polygons. By comparing the elapse time of our method with vista-buffer algorithm, we can acquire improvement in speed that it is 3 times faster than vista-buffer algorithm. We also try to apply our method to reflective objects.
Index Terms:
ZF-buffer, ray-tracing, intersection test
Citation:
Sehyun Kim, Sung-ye Kim, Kyung-hyun Yoon, "A Study on the Ray-Tracing Acceleration Technique Based on the ZF-Buffer Algorithm," iv, pp.393, Fourth International Conference on Information Visualisation (IV'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.