Area filling algorithms - output primitives, Computer Graphics

Assignment Help:

Area Filling Algorithms

Before we go ahead with area filling algorithms, a word about pixel addressing and object geometry. You know that line segments are discretized into finite number of pixels and each pixel has its height and width depending upon the aspect ratio of the display unit.Therefore, if you plot a single pixel it will occupy some area on display unit.  This contributes to the object geometry resulting in aberrations from the actual size.  For example, if you have to plot a line segment starting from (10,10) to (15,10), then length of the segment is 5 whereas, in plotting this line segment, six pixel areas will be contributing to this segment, resulting in increased length of line segment by one unit.


Related Discussions:- Area filling algorithms - output primitives

Y-shear about the origin - 2-d and 3-d transformations, y-shear about the o...

y-shear about the origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') in the x-direction, through the specified scale parameter 'b'. that

Displacement mapping, Implement displacement mapping and bump mapping on a ...

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

Zero acceleration (constant speed), Zero Acceleration (Constant Speed ) ...

Zero Acceleration (Constant Speed ) Now, the time spacing for the in-betweens that is: in-between frames is at equal interval; which is if, we want N in-betweens for key frames

Multimedia applications, what are activities to be undertaken or executed a...

what are activities to be undertaken or executed and the expected output of each activity for a plan creation of a movie?

Reflecting the ball off of a polyline, To reflect the ball off of the polyl...

To reflect the ball off of the polyline, we need to re?ect it off of the segment that had the minimum thit. But the reflection computation depends only on t hit , n, P and v, so th

Raster and random scan displays - hardware primitive, Raster and random sca...

Raster and random scan displays In Raster scan displays, whole screen is refreshed a number of times in a second to keep the picture visible on the screen. This is called refre

What happens while two polygons have similar z value , What happens while t...

What happens while two polygons have similar z value and the z-buffer algorithm is utilized? Solution : z-buffer algorithms, varies colors at a pixel if z(x,y)

Various ways of simulating motion, Various ways of simulating motion:- ...

Various ways of simulating motion:- -        Zero Acceleration (Constant Speed)           -        Non-Zero Accelerations -        Positive accelerations

Polygon tables - curves and surfaces, Polygon Tables - curves and surfaces ...

Polygon Tables - curves and surfaces All polygons are analogous to a graph G (V, E). Remember that the analogy in which a polygon surface can be specified along with as a set

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