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
Question: (a) After having worked for several years as a graphic designer you decide to start a company of your own; MediaDesign ltd. The most valuable asset of a company is i
Assumption for Diffuse Reflection - Polygon Rendering i) the diffuse reflections by the surface are scattered along with equal intensity in each direction, independent of vie
Resolution Graphic demonstrations are utilized in presentations to assist convey a concept or express a mood, two kinds of demonstrations graphics are: Vector, and B
Homogeneous Coordinate Systems - 2-d and 3-d transformations Suppose P(x,y) be any point in 2-D Euclidean (Cartesian) system. In HC System, we add a third coordinate to a poin
What are the steps involved in 3D transformation? Modeling Transformation Projection Transformation Viewing Transformation Workstation Transformation
Determine the transformation matrix for the reflection, Computer Graphics
What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm? DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham
Arguments made in favour of Analog Sound Shape of the waveforms: from digital signals sound reconstructed which is claimed to be harsher and unnatural compared to analog si
State the technology used in LCD Some passive matrix (Pixels are illuminated in scanline order like a raster display but the lack of phospherescence causes flicker) LCDs have
Illustration of a Clipping window ABCD is placed as follows: A (100, 10), B (160, 10, C (160, 40), D (100, 40) By using Sutherland-Cohen clipping algorithm determine the vis
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