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
what is zooming and panning in computer graph please explan??

What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm? DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham

Question 1 Write a note on digitizers Question 2 Discuss on line drawing algorithm Question 3 Explain 3D viewing Question 4 Explain different types of cohe

Orthographic and Oblique Projection - Viewing Transformation Orthographic projection is the easiest form of parallel projection that is commonly utilized for engineering drawi

Derive the common transformation for parallel projection into a specified view plane, here the direction of projection d=aI+bJ+cK is along the normal N=n1I+n2J+n3K along with the r

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        ..

Rotation about an arbitrary axis Rotation about an arbitrary axis is a composition of several rotations and translation operations. What you need to do is the following:  a)

Education courses, skills, and knowledge are sometimes taught of context because of lack of application of real time examples. To resolve this, educators are using multimedia to br

how you doing the graphic?

Ask question #Minimum how can we use stroke method method for character generation? 100 words accepted#