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

Prepare a cylinder, Question: (a) Write a short note on the dot syntax...

Question: (a) Write a short note on the dot syntax as used in actionScript. (b) A data type describes the kind of information a variable or ActionScript element can hold.

Animated gif, Animated GIF: For combining various GIF images in a particul...

Animated GIF: For combining various GIF images in a particular file to create animation, GIF file format is used. There are several drawbacks to such functionality. The form

Image space -approaches for visible surface determination, Image Space Appr...

Image Space Approach -Approaches for visible surface determination The initial approach as image-space, determines that of n objects in the scene is visible at every pixel in

Phong specular reflection model or specular reflection, Phong Specular Refl...

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

Vecgen algorithm and bresenham line, what is vecgen algorithm and bresenha...

what is vecgen algorithm and bresenham linequestion..

Draw line segment - digital differential analyzer algorithm, Example 1: Dr...

Example 1: Draw line segment from point (2, 4) to (9, 9) by using Digital Differential Analyzer algorithm. Solution: We know usual equation of line is specified via y = mx

C++ programming, self test exercise 17 asked you to overload the operator >...

self test exercise 17 asked you to overload the operator >> and the operator Overload biinary operator + to add pairs according to the rule (a, b) + (c, d) = (a + c, b, + d) overl

Region filling, what is region filling? give details

what is region filling? give details

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

Draw a long line segment using dda line drawing algorithm, Draw a long line...

Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from

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