2d line segment generation - 2d shape primitives, Computer Graphics

Assignment Help:

2D Line Segment Generation 

A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on a computer display.  This is needed because the display devices can only plot a finite number of points, however large the resolution of the device may be.  So, the key concept of any line drawing algorithm is to provide an efficient way of mapping a continuous abstract line into a discrete plane of computer display. 

This process is called rasterization or scan conversion.  These algorithms basically approximate a real valued line by calculating pixel coordinates to provide an illusion of line segment.  Since the pixels are sufficiently small, the approximation gives a good illusion of a continuous line segment to the human eyes.  To understand what is meant by rasterization, we plot a line segment on a pixel grid as shown in Fig (a).  The segment points are scan converted and approximated by a single shaded pixel as shown in Fig (b). Here we have shown a pixel by a square, but you know that a pixel actually has a disc shape with the boundary marked as the visible portion of the dot formed by the striking electron gun. The pixel shown here is the bounding rectangle of that dot.


Related Discussions:- 2d line segment generation - 2d shape primitives

Offset lithography printing, QUESTION A trainee designer, Susan, joins ...

QUESTION A trainee designer, Susan, joins your place of work. During a workshop, you are asked to present on printing procedures and agencies in Mauritius. Susan asks you what

3-dimentional, expalin 3-dimentional display methods

expalin 3-dimentional display methods

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

Line drawing algorithm, when dda line drawing algorithm is more efficient t...

when dda line drawing algorithm is more efficient than bresenhem line drawing algorithm?

Trivial rejection case of cohen sutherland line clippings, Trivial Rejectio...

Trivial Rejection Case of cohen sutherland line clippings Case: it  is Trivial Rejection Case; if the logical intersection (AND) of the bit codes of the end points P, Q of

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