Disadvantages of the z-buffer method, Computer Graphics

Assignment Help:

Disadvantages:

1)   Doubles memory needs, one for at least z-buffer and one for refreshes- buffer.

2)   Dependency of device and memory intensive.

3) Wasted calculation upon drawing distant points such are drawn over along with closer points which occupy the similar pixel.

4)   Spends time when rendering polygons such are not visible.

5)   Needs re-calculations while changing the scale.

 


Related Discussions:- Disadvantages of the z-buffer method

Objectives-visible-surface detection, After going through this section, you...

After going through this section, you should be capable to: know the meaning of Visible-surface detection; distinguish among image-space and object-space approach for vi

Horizontal retrace - hardware primitives, Horizontal Retrace - Hardware Pri...

Horizontal Retrace - Hardware Primitives Horizontal retrace refers to the time an electron beam takes to traverse a scan line.Vertical retrace means the time taken by the elect

Acquire a transformation matrix for perspective projection, Acquire a trans...

Acquire a transformation matrix for perspective projection for a specified object projected onto x=3 plane as viewed by (5,0,0). Solution: Plane of projection: x = 3 as given.

What will be the resulting rotation matrix, An object has to be rotated abo...

An object has to be rotated about an axis passing through the points (1,0 ,1), (1,3,1) .  What will be the resulting rotation matrix?    Solution: The axis is parallel to y axis

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

Cohen sutherland, explain cohen sutherland line clipping algorithm

explain cohen sutherland line clipping algorithm

Jas file formats, JAS: The JAS file formats were implemented to form the s...

JAS: The JAS file formats were implemented to form the smallest possible picture files for 24bits per pixel image and 8 bit per pixel gray scaled pictures. This uses a discrete co

Assumption for digital differential analyzer algorithm, Assumption regardin...

Assumption regarding to the Digital Differential Analyzer Algorithm The line generation by DDA is discussed merely for the first Quadrant, whether the line lies in the other q

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Scan conversion, State the purpose of scan conversion , along with the side...

State the purpose of scan conversion , along with the side effects

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd