![]() The polygons at more distance are painted firstly. It is called the painter algorithm because the painting of frame buffer is done in decreasing order of distance. If z objects overlap each other as in fig (b) this correct order can be maintained by splitting of objects.ĭepth sort algorithm or painter algorithm was developed by Newell, sancha. If z values of two overlap, we can determine the correct order from Z value as shown in fig (a). Pixels of rear one will overwrite pixels of farther objects. Rendering is done in order of z coordinate. Objects are arranged in increasing order to z coordinate. If objects are reversed in a particular order, then correct picture results. In this algorithm ordering of visibility of an object is done. It is also called a depth-sort algorithm. ![]() It came under the category of list priority algorithm.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |