Removing polygons hidden through a surrounding polygon, Computer Graphics

Removing Polygons Hidden through a Surrounding Polygon:

The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding polygon. Thus, it can be eliminated by the PVPL. To assist processing, this list is sorted through zmin, the smallest z coordinate of the polygon inside this area. Furthermore, for all surrounding polygons S, we record also its largest z coordinate, zsmax.

For a polygon P on the list as zpmin >zsmax only for a surrounding polygon S, then P is hidden through S and hence is not visible. As well, all other polygons after P on the list will also be hidden through S, thus we can eliminate these polygons by the PVPL.

Posted Date: 4/5/2013 1:33:48 AM | Location : United States







Related Discussions:- Removing polygons hidden through a surrounding polygon, Assignment Help, Ask Question on Removing polygons hidden through a surrounding polygon, Get Answer, Expert's Help, Removing polygons hidden through a surrounding polygon Discussions

Write discussion on Removing polygons hidden through a surrounding polygon
Your posts are moderated
Related Questions
As we already seen that the scaling process is mainly utilized to change the size of an object. The scale factors find out whether the scaling is a magnification as s>1 or a red

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

AVI CODEC Formats: Various AVI file formats other than the DV Types 1 and 2 formats are there discussed earlier. All such the other formats involve the utilization of Compressor o

Progressive Scan: Progressive or non-interlaced scanning is a process which displays, transmits or stores moving images wherein, the lines of all frame are drawn in order. It is i

Phong Specular Reflection Model or Specular Reflection This model of local illumination is frequently termed as the Phong specular reflection model. Here we discuss the matter

Stochastic Animation - Computer Animation This utilizes stochastic processes that are a stochastic process can be identified as a random function. Such randomness could be in

What is meant by Addressability? Ans. Addressability is the number of individual dots per inch (d.p.i.) that can be formed. If the address of the current dot is (x, y) then the

what is the opengl code for tcp connection?

What is the maximum number of objects such can be handled via the depth/z- buffer algorithm? Solution : In z-buffer algorithm, an arbitrary number of objects can be handled sin

Three Sub-Fields of Computer Simulation Computer simulation is the electronic equivalent of this kind of role playing and it functions to drive synthetic environments and virt