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 algorithm and seed fill algorithm
Two basic approaches are followed in area filling on raster systems. In the first approach overlap intervals for scan lines that cross the area are determined per scan line. Remember that a scan line is a horizontal line of pixels that can be plotted on the display device when the electron beam traverses the display area horizontally during one horizontal retrace. Second approach begins with an interior point and fills the area moving outward from this point until the boundary condition is reached. An algorithm following the first approach is classified as scan line algorithm and that falling under second class is called seed fill algorithm. Simple objects such as polygons, circles etc. are efficiently filled with scan line fill algorithms and more complex regions use the seed fill method. The scan line algorithm is mostly used in general graphics packages.
Let us begin with scan line polygon fill algorithm. Notice that polygons can be as simple as a triangle and could be as complicated as the one shown in Figure below.
These are self intersecting polygons. We broadly keep the polygons in one of the three categories (i) convex (ii) concave (iii) self intersecting. Mathematically, a self intersecting polygon is concave. You will deal with such polygons in greater details for the purpose of area filling.
Problem : a. (i) Give another name for adjacent color. (ii) Describe briefly what do you understand by an adjacent color? b. (i) Describe briefly what do you unders
Approaches to Area Filling Some other approaches to area filling are Scan line polygon fill algorithm Boundary fill algorithm Flood fill algorithm.
Consider a raster system with the resolution of 1024 x 768 pixels and the color palette calls for 65,536 colors. What is the minimum amount of video RAM that the computer must have
To transform from the world coordinate system to viewing coordinate system you need to perform the following operations. a) Translate the viewing coordinate origin to the worl
A triangle is having the vertices A(0,0) B(1,2) and C (5,2).Magnify the triangle to thrice it''s size while keeping C(5,2) fixed
Specular Reflection - Polygon Rendering & Ray Tracing Methods Specular reflection is while the reflection is stronger in one viewing direction that is a bright spot, termed
explainapplication of coherence in visible surface detection method
Potentially entering and leaving points - P E and P L The intersection point of the line and window might be classified either like potentially leaving or entering. Before g
Traditional Animation techniques as: 1) Key Frames 2) Cel Animation Formula: Required Key frames for a film = {[Time(in seconds)]
Assumption regarding to the Digital Differential Analyzer Algorithm The line generation by DDA is discussed merely for the first Quadrant, whether the line lies in the other q
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