Picture information - raster graphics and clipping, Computer Graphics

Assignment Help:

Picture Information - Raster Graphics and  Clipping

Now, the picture information is accumulated in the form of bit plans on which all bit plane complete information of picture is stored and for brightest intensity three bit plane just for simplicity must have one as respective information in the frame buffer, whether it is zero so, the intensity will be the least; several of the intensity combination are given as:

1841_Picture Information - Raster Graphics and  Clipping.png

Maximum intensity of a pixel means: the value for that point on all bit planes is one that produces maximum intensity to contain a bit low intensity any one of the bit plane is provided information 0 for such point as:

If picture information is accumulated in two bit planes then possibilities are:

0 0        min. intensity of a point

0 1        medium intensity of a point

1 0        medium intensity of a point

1 1        max intensity of a point

For consequent pixel on screen:

  • Each information digit is 0 or 1 for respective bit plane in continuation,
  • Each digit constitutes the information for a point in the respective bit plane,
  • For two bit planes we have four levels, likewise, three bit planes we have eight levels that is for n bit planes we have 2n levels.

⇒ For n bit plane 2n amount of information is required.

  • Through adopting this method of picture information storage, certainly, we can vary the intensity of adopting although extra memory consumption occurs because there may be exists more bit planes.
  • For controlling the intensity of the colours, we require a minimum of eight bit planes that is picture information has to have eight digits (0, 1) additionally 28 combinations occur.
  • For colours case we require in common 3 e- guns of 3 colours as red, green and blue for picture display along with varying colours.

 

1455_Picture Information - Raster Graphics and  Clipping 2.png

Figure: Frame Buffer: Colour Variation of a Pixel

As in the above figure we contain 3 bit planes consequently we have three digit numbers. If information in all planes i.e. R, G, B is zero as (0, 0, 0) after that there is no display. Another situation is listed as given below:

 

R

G

B

 

So,

0

0

0

no display

 

0

0

1

Blue display

 

0

1

0

Green display

 

0

1

1

Green-blue mix display and so on.

Likewise, for more colours we must have more bit planes and hence more numbers of digits signify more colour combinations.


Related Discussions:- Picture information - raster graphics and clipping

Consider shiny surface with diffused reflection coefficient, Consider a Shi...

Consider a Shiny Surface Along With Diffused Reflection coefficient Consider a shiny surface along with diffused reflection coefficient of 0.8 and ambient reflection coeffici

Crt, refreh buffer

refreh buffer

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

What is a color management system, QUESTION a) What is a color manageme...

QUESTION a) What is a color management system? Briefly explain how it works. b) What are the three major factors affecting print permanence? c) Briefly explain three ways

Aspect ratio - display devices, Aspect ratio - Display Devices Ratio of...

Aspect ratio - Display Devices Ratio of vertical points to horizontal points necessary to produce equal length lines in both directions on the screen. For example, in a CRT mon

Mplab ide software, MPLAB C18 TOOL (MC18) The MPLAB C18 compiler was de...

MPLAB C18 TOOL (MC18) The MPLAB C18 compiler was designed as a full featured ASNI- compliant C - complier for the PIC18 family of 8bits MCUs. MC18 compiler is integrated with c

Problems at shared vertices - modeling and rendering, Problems at Shared Ve...

Problems at Shared Vertices - Modeling and Rendering Shading discontinuities can arise while two adjacent polygons fail to share a vertex which lies along their common edge.

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