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
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
Remark for the Bresenham Line Generation Algorithm Remark: The algorithm will be properly the same if we suppose | m | Algorithm | m | (a) Input two line endi
Which is the most usable and frequent method to generate a character?
what is frame buffer
Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho
Question: (a) Differentiate between lossy and lossless compression. (b) State the uses of the two compression standards MPEG-1 and MPEG-2. (c) State three areas where
Describe briefly Sutherland Cohen line clipping algorithm. OR Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith
Find Out Projection Matrix for Oblique Projection To find out projection matrix for oblique projection, we want to find out the direction vector d. Because vector PP' and vect
MULTIMEDIA TOOLS : In this sense, we will emphasize on various tools utilized in the field of multimedia. Basic Tools: The fundamental toolset for building multimedia p
What is the best selection method in photoshop
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