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
Consider at line segment AB in the Figure k, parallel to the z-axis along with end points A (3, 2, 4) and B (3, 2, 8). Perform a perspective projection on the z = 0 plane from the


Bezier curves: Theses are special polynomial curves expressed using Bernstein polynomials. Spline curves are simple extensions of Bézier curves composed of two or more polynom

Define Affine transformation?  A coordinate transformation of the form X= axxx +axyy+bx, y 'ayxx+ayy y+by  is known as a two-dimensional affine transformation. Every of the tra

An animation demonstrates a car driving along a road that is given by a Bezier curve along with the subsequent control points:  X k 0 5

In contrast to depth-buffer method, here we identify one surface at one time, scan-line method deals along with multiple surfaces. Since it processes each scan-line at one time, al

Viewing Transformation In previous section, we have discussed about the geometric transformations as Translation, Shearing, Reflection, Scaling and Rotation. Rotation, Reflect

Persistence: How long they continue to emit light (that is, have excited electrons returning to the ground state) after the CRT beam is removed. Persistence is defined as the ti

Line Generation Algorithms - Graphic Primitives In previous section we have discussed the case of frame buffer, here information regarding the image to be projected upon the

What is shearing?  The shearing transformation actually slants the object with the X direction or the Y direction as needed.ie; this transformation slants the shape of an obje