Differentiate between z-buffer method and scan-line method, Computer Graphics

Differentiate between z-buffer method and scan-line method. What is the visibility test made in these methods?

Solution: In depth buffer algorithm every pixel location on the projection plane is identified for determining the visibility of surfaces regarding this pixel. Conversely, in scan-line method all surfaces intersected through a scan line are studied for visibility. The visibility test in depth-buffer method engages the comparison of depths of surfaces regarding a pixel on the projection plane. The surface closest to the pixel position is seemed visible. The visibility test in scan-line method which compares depth computations, for each overlapping surface to find out which surface is nearest to the view-plane hence it is declared as visible

 

Posted Date: 3/22/2013 8:48:15 AM | Location : United States







Related Discussions:- Differentiate between z-buffer method and scan-line method, Assignment Help, Ask Question on Differentiate between z-buffer method and scan-line method, Get Answer, Expert's Help, Differentiate between z-buffer method and scan-line method Discussions

Write discussion on Differentiate between z-buffer method and scan-line method
Your posts are moderated
Related Questions
View Volumes and General Projection Transformations You have to remember that the view volume is the volume which sets up near and far extents, top and bottom extents and left

Specified p 0 (1, 1): p 1 (2, 3); p 2 (4, 3); p 3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve? Solution : We consider Cubic Bezier curve as: P (

How many key frames does a one-minute animation film order along with no duplications need? Solution : One minute = 60 seconds Number of frames needed per second=24 Numbe

What is persistence? The time it takes the emitted light from the screen to decompose one tenth of its original intensity is known as persistence.

Concept for Eliminating Hidden Lines, Surfaces or Edges To exemplify the concept for eliminating hidden-lines, surfaces or edges, see a classic wire frame model of a cube as i

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

State the Areas of use of data goggles Entertainment   Used in television/films as special effects (for example "holodeck" in Star Trek: The Next Generation and Brazilian

Transformation for 3-D Scaling 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 i

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p