Line drawing - points and lines, Computer Graphics

Assignment Help:

Line Drawing - Points and lines

Line drawing is accomplished through computing the intermediate point coordinates along the line path between two given end points. Since, screen pixels are referred along with integer values, plotted positions may only around the calculated coordinates that is pixels that are intensified are those such lie very near to the line path if not precisely on the line path that is in the case of absolutely horizontal, vertical or 45° lines merely.

562_Line Drawing - Points and lines.png

 

Figure: Stair case effect

Standard algorithms are accessible to find out which pixels provide the best approximation to the desired line. Screen resolution conversely, is a large factor towards enhancing the approximation. In a high resolution system such adjacent pixels are very closely spaced which the approximated line-pixels lay extremely close to the real line path and thus, the plotted lines appear to be vary smoother; mostly like straight lines drawn upon paper. In a low resolution system, the similar approximation technique causes lines to be shown with a "stair-step appearance" that is not smooth as demonstrated in following figure; the effect is termed as the stair case effect.


Related Discussions:- Line drawing - points and lines

Application areas of computer graphics, Explain application areas of comput...

Explain application areas of computer graphics in different areas.    Early computer graphics has only certain special capabilities such as straight lines circles and ellipses

What do you mean by parabolic splines, What do you mean by parabolic spline...

What do you mean by parabolic splines?  For parabolic splines a parabola is fitted by the first three points p1, p2,p3 of the data array of kot points. Then a second parabolic

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Transform from the world to viewing coordinate system, To transform from th...

To transform from the world coordinate system to viewing coordinate system you need to perform the following operations.  a)  Translate the viewing coordinate origin to the worl

Three dimensional display methods - 2d clipping algorithms, Three dimension...

Three dimensional display methods: Among the simplest three dimensional surface representations are the polygonal surfaces.  A polygonal surface is described by vertices

Scancode, what is mean by scan code

what is mean by scan code

Draw a long line segment using dda line drawing algorithm, Draw a long line...

Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from

., Define the working procedure of CRT with diagram

Define the working procedure of CRT with diagram

Classic applications of digital video, The table as given below demonstrate...

The table as given below demonstrates possible values of such parameters for classic applications of digital video. Application                  Frame rate                  Dime

Color Histograms - Scene Categories, How can I perform feature extraction o...

How can I perform feature extraction on images of different classes? How to obtain a vector of each class that contains its features?

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