Points and lines - graphic primitives, Computer Graphics

Points and Lines - Graphic primitives

In the previous section, we have seen to draw primitive objects; one has to firstly scan convert the objects. This concern to the operation of determining the location of pixels to be intensified and then sets the values of consequent bits to the desired intensity level. All pixels on the display surface have a fixed size depending upon the screen resolution and thus, a pixel cannot characterize a single mathematical point. Conversely, we consider all pixels as a unit square area known through the coordinate of its lower left corner and the cause of the reference match system being located at the integer coordinate pair (x, y). The x values start at the origin and rise from left to right along a scan line and the y values that is the scan line numbers begin at bottom and raise upwards.

459_Points and Lines - Graphic primitives.png

                                                                             Figure: Scan lines

This demonstrates the Array of square pixels upon the display surface. Coordinate of pixel A: 0, 0; B: 2, 2; C: 6, 7. A coordinate position (6.26, 7.25) is characterized via C, while (2.3, 2.5) is demonstrated via B. As in order to plot a pixel on the screen we required to round off the coordinates to a nearest integer. Moreover, we require saying that, this is this rounding off, that leads to distortion of any graphic pattern.

Posted Date: 4/3/2013 1:32:19 AM | Location : United States







Related Discussions:- Points and lines - graphic primitives, Assignment Help, Ask Question on Points and lines - graphic primitives, Get Answer, Expert's Help, Points and lines - graphic primitives Discussions

Write discussion on Points and lines - graphic primitives
Your posts are moderated
Related Questions
Draw the block diagram of raster scan display processor.

Combination of Positive and Negative Accelerations Actually, it is not that a body once decelerated or accelerated will remain so, although the motion may include both speed-up

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

Scan Line Algorithm A scan line algorithm determines the overlap intervals of the polygon with each scan line to obtain interior points of the polygon for assigning those point

what is mean by virtual reality?

Curves and Surfaces - Modeling   and Rendering We have studied the method of drawing curves in diverse coordinate systems. Also we got the concept that it is the revolution of

For this assignment, you will program a game called Pig. Pig is a two-player game where players compete to be the first to reach (or surpass) 100 points. Pig usually involves playe

Figure uses three dashed arcs and one small circle. Dashed line or arc is a style attribute that can be attached with a line or a curve. In OpenGL you can use the line stipple func

Pitfalls in computer simulation Though generally avoided in computer simulations, in strict logic the rules governing floating point arithmetic even apply. For illustration, t

Film - Applications for Computer Animation Computer animation has turn into regular and accepted in particular effects. Movies as "Jurassic Park", "Terminator 2: Judgment Day"