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

Briefly explain how you could create the gun barrel effect, Question 1: ...

Question 1: (a) Describe what you understand by Rotoscoping in Graphic effects. Give details how Rotoscoping could be achieved in After Effects CS3. (b) Using one algorithm

What are the disadvantages with the boundary representation, Disadvantages ...

Disadvantages with the Boundary Representation (i) It requires more storage than the corresponding half-space method. (ii) There is no guarantee that the object created is v

Introduction, how can we write the introduction matter for graphicaluser in...

how can we write the introduction matter for graphicaluser interface

Pixel paint, PIXEL PAINT: The pixel paint file format permits a document t...

PIXEL PAINT: The pixel paint file format permits a document to be opened in the pixel paint and pixel paint professional graphics application. Such format permits you to identify

Archeology-applications for computer animation, Archeology: along with the...

Archeology: along with the advent of the computer, the archeologist has obtained a new tool, computer animation. An object-model can be made comparatively quick and without any we

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Scaling, uniform scaling and differential scaling with the help of diagram

uniform scaling and differential scaling with the help of diagram

Understanding the concept of hypertext and hypermedia, Understanding the Co...

Understanding the Concept of hypertext and hypermedia: For know the principle of Hypertext and Hypermedia we will look at how the human memory works.

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