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

What is the feature of inkjet printers, What is the feature of Inkjet print...

What is the feature of Inkjet printers? Features of inkjet printers: They can print 2 to 4 pages/minutes. Resolution is about 360d.p.i. Thus better print quality is achie

Sutherland hodgman algorithm, Sutherland-Hodgman Algorithm Any polygon...

Sutherland-Hodgman Algorithm Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the po

Panning and zooning, what is zooming and panning in computer graph please e...

what is zooming and panning in computer graph please explan??

Definitions of hypermedia, Definitions of Hypermedia It is a term ...

Definitions of Hypermedia It is a term created through Ted Nelson in the year 1970. It utilized as a logical extension of the term hypertext, wherein graphics, video, audi

Advertising-applications for computer animation, Advertising: One of the m...

Advertising: One of the most well known uses for computer animation is in television advertising. Many of the models which the commercials would call for would be extremely compli

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

How does the z-buffer algorithm find out which surfaces, Illustration 1: H...

Illustration 1: How does the z-buffer algorithm find out which surfaces are hidden? Solution : Depth or Z-buffer algorithm employs a two buffer area each of two-dimensional ar

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