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

Viewing transformation, Viewing Transformation In previous section, we...

Viewing Transformation In previous section, we have discussed about the geometric transformations as Translation, Shearing, Reflection, Scaling and Rotation. Rotation, Reflect

What are the disadvantages of CAD, Disadvantages of CAD - Risk of deski...

Disadvantages of CAD - Risk of deskilling - High training costs to use packages - Can move work overseas     One CAD operator can do work of 5 manual draftsmen

Transformation, Define transformation. Explain all basic transformation

Define transformation. Explain all basic transformation

Graphics programming, Explain rubber-band interactive picture technique

Explain rubber-band interactive picture technique

Explain the merits and demerits of penetration techniques, Explain the meri...

Explain the merits and demerits of Penetration techniques. The merits and demerits of the Penetration techniques are as follows:     It is an inexpensive method.     It h

Referential links, Referential Links: A third type of link is a referentia...

Referential Links: A third type of link is a referential link. It is associated to the associative link. Quite than representing a relationship among two related ideas, a referent

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

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

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