Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Scan Line Polygon Fill Algorithm - Raster Graphics
In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel that is, of both interior region and boundary are considered and, are so plotted. This time we are going to perform scan conversion of solid regions; here the areas are bounded through polygonal lines. Pixels are considered for the interior of the polygonal area and are then filled plotted along with the predefined colour. Now let us discuss the algorithm briefly and then we will further discuss details on the similar.
This algorithm checks and modifies the attributes (that is parameters and characteristics) of the pixels only with the current raster scan line. Immediately it crosses over from the outside to the inside of a boundary of the particular polygon it begins resetting the colour or as gray attribute. In filling effect the region along that scans line. Such changes back to the initial attribute while it crosses the boundary again. In following figure, shows variations of this basic idea.
Figure: Concept of scan line polygon filling
Hence as to understand Scan Line Polygon Fill Algorithm in detail consider in following figure:
Figure: Scan line polygon filling
What is scan line algorithm? One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig
Consider the line segment AB in 3-Dimentional parallel to the z-axis along with end points A (- 5,4,2) and also B (5,-6,18). Carry out a perspective projection upon the X=0 plane;
Sound and Audio: Sound is a mechanical energy disturbance which propagates by matter as a wave. Sound is characterized through the various properties that are: frequency, per
Construction of a Solid with a Translational Sweep Figure demonstrates construction of a solid along with a translational sweep. Translating the control points of the periodic
Important point about the De casteljeau algorithm 1) Bezier Curve: P (u) = ................ (1) Here B n,i (u) = n c i u i (1 - u) n-i ..
Advantages of the Boundary Representation (i) This format gives efficient picture generation and easy access to other geometric information. (ii) The changes produced by mos
Translation - 2-d and 3-d Transformations It is the process of changing the position of an object. Suppose an object point P(x,y)=xI+yJ be moved to P'(x',y') by the specified
Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries
define composite transformation
WHAT IS PAINTERS ALGORITHM?
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd