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

Various cases of cohen sutherland line clippings - algorithm, Various cases...

Various cases of Cohen Sutherland Line Clippings Currently, we study how this clipping algorithm works. For the sake of simplicity we will tackle all the cases with the assist

Briefly explain how you could create the gun barrel effect, Question 1: ...

Question 1: (a) Describe what you understand by Rotoscoping in Graphic effects. Give details how Rotoscoping could be achieved in After Effects CS3. (b) Using one algorithm

Unity, what I unity of java game?

what I unity of java game?

Authoring tools in multimedia, Authoring Tools Authoring tools genera...

Authoring Tools Authoring tools generally refers to computer software that assists multimedia developers produce products. Authoring tools are various from computer programmi

Trivial acceptance case of cohen sutherland line clippings, Trivial accepta...

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000

Liang barsky line clipping algorithm, Liang Barsky line clipping algorithm ...

Liang Barsky line clipping algorithm : The algorithm uses parametric form of the line segment.  Four inequalities are created using the parametric form of the line segments.  Th

Displacement mapping, Implement displacement mapping and bump mapping on a ...

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

2d line segment generation - 2d shape primitives, 2D Line Segment Generatio...

2D Line Segment Generation  A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on

Macintosh - hardware for computer animation, Macintosh - Hardware for compu...

Macintosh - Hardware for computer animation It was originally designed to be graphic and desktop publishing machines. Macs did not turn into which widely known till recently, a

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