Storing information structures in display memory, Computer Graphics

Assignment Help:

What is the major disadvantages of storing information structures in display memory? A major disadvantage of storing information structures in display memory is that when color and intensity variations are incorporated into a frame buffer raster graphic device additional bit per pixel are required to produce these variations. Thus, the memory area required increase with increase in color and intensity variations. Thus larger memory areas are required to be kept reserved for color graphics display. Secondly since the frame buffer is a digital device and the CRT is and analog device so whenever some information is demanded from frame buffer, the information must first pass through a digital to analog converter and then transferred to the CRT.


Related Discussions:- Storing information structures in display memory

Ray tracing algorithm - recursive, Ray Tracing Algorithm - Recursive ...

Ray Tracing Algorithm - Recursive Frequently, the basic ray tracing algorithm is termed as a "recursive" acquiring an outcome wherein a given process repeats itself an arbitr

Z-buffer algorithm, How to implement z-buffer algorithm using C programming...

How to implement z-buffer algorithm using C programming

Raster scan display device - types of refresh monitors, Raster Scan Display...

Raster Scan Display Device - types of refresh monitors Now day screen display is also based on Cathode ray Tube technology, except that in place of displaying the picture tra

What is computer graphics?, What Is Computer Graphics? The term Graphi...

What Is Computer Graphics? The term Graphics mean is Graphical Tricks. All image or picture is actually a graph and when various mathematical tricks are utilized to manipulate

Area subdivision method for hidden surface removal, Q.  Write a short note...

Q.  Write a short note on area subdivision method for hidden surface removal.   Ans. Area Subdivision This technique for hidden- surface removal is essentially an image- spac

Bresenham line generation algorithm, Bresenham Line Generation Algorithm ...

Bresenham Line Generation Algorithm This algorithm is exact and efficient raster line generation algorithm. Such algorithm scan converts lines utilizing only incremental integ

Polygon filling algorithm - raster graphics and clipping, Polygon Filling A...

Polygon Filling Algorithm - Raster Graphics and Clipping In several graphics displays, this becomes essential to differentiate between different regions by filling them along

Transformation for isometric projection - transformation, Transformation fo...

Transformation for Isometric projection - Transformation Suppose that P(x,y,z) be any point in a space.  Assume as a given point P(x,y,z) is projected to the P'(x'y',z') on t

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

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

Advantages of bresenham’s line drawing algorithm, What are the advantages o...

What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm? DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham

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