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

Types of animation systems, Types of Animation Systems: Keyframe, scriptin...

Types of Animation Systems: Keyframe, scripting and parameterized •Morphing: object shape's transformation from one form to the other is termed as morphing that is short form

Oblique projection, find the transformation and draw the cube for cavalier...

find the transformation and draw the cube for cavalier and cabinet with theta = 37 degree

Overstriking, why overstriking is harmful.justify

why overstriking is harmful.justify

How to identify window area - raster graphics and clipping, A convex polygo...

A convex polygonal region having n- vertices {P 0 , P 1 , P 2 ..., P n - 1 , P n , P 0 } or lattice points to be identified by the user includes the convex window area. To be exact

What is seed fill, What is seed fill?  One way to fill a polygon is to ...

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel

Area subdivision method-obscures the continuing two surface, Assume here ar...

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5) And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,

Limitations of cohen sutherland line clipping algorithm, Limitations of Coh...

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a

Intersection test - visible surface detection, Intersection Test - Visible ...

Intersection Test - Visible Surface Detection Test: It called Intersection Test also: we go for intersection test, if Min-max test fails. Now we take each edge individually

B-spline curves - uniform b-splines and de boor algorithm, B-spline curves ...

B-spline curves are piecewise smooth polynomial curves.  B-spline curves are defined over an interval which has been partitioned into sub-intervals. On each subinterval B-sp

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