Üç boyutlu canlandırma sisteminde gerçeğe benzetme

Abstract

The hidden line/hidden surface problem is öne of the more difficult in computer graphics. Hidden line/hidden surface algorithms attem.pt to determine the lines edges, surfaces ör volumes that öne visible ör invisible to an observer located at a specific point in space. The complexity of hidden line/hidden surface problem has resulted in a large number of diverse solutions. Many of diverse solutions. Many of these öne för specialised applications. There is no best solution to the hidden line/hidden surface problem. Ali hidden line/hidden surface algorithms involve sorting. The order in which sorting of the geometric co- ordinates occurs is generally immaterial to the efficiency of the algorithms. We used the z-buffer algorithm for the hidden surface algorithm. The technique was originally proposed by Catmull and is an image space algorithm. A frame buffer is used to store the attributes of each pixel in image space. The z buffer is a separate depth buffer used to store the z co-ordinate ör depth of every visible pixel in image space. in use, the depth ör z value of a new pixel to be written to the frame buffer is compared to the depth of that pixel stored in the z buffer. If the comparison indicates that the new pixel is in front of the pixel stored in the frame buffer, then the new pixel is written to the frame buffer and the z buffer updated with the new z value. If not, no action is taken. it handles the hidden surface problem and display of complex surface intersections trivially. Simply defined, rendering is process of producing realistle images ör pictures. Producing realistle images involves both physics and psychology.