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

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.

Posted Date: 4/26/2013 1:08:00 AM | Location : United States

Related Discussions:- 2d line segment generation - 2d shape primitives, Assignment Help, Ask Question on 2d line segment generation - 2d shape primitives, Get Answer, Expert's Help, 2d line segment generation - 2d shape primitives Discussions

Write discussion on 2d line segment generation - 2d shape primitives
Your posts are moderated
Related Questions
JAS: The JAS file formats were implemented to form the smallest possible picture files for 24bits per pixel image and 8 bit per pixel gray scaled pictures. This uses a discrete co

Draw the block diagram of raster scan display processor.

Explain Various techniques of Character Generation Algorithm?

What is resolution? Ans. The maximum number of points that can be shown without an overlap on a CRT is known as resolution.

Other curves - parabola and hyperbola Conic sections such as parabola and hyperbola are used in many instances such as in motion planning along a trajectory or in modelling the

View Volumes and General Projection Transformations You have to remember that the view volume is the volume which sets up near and far extents, top and bottom extents and left

What do you mean by emissive and non-emissive displays?  The emissive display changes electrical energy into light energy. The plasma panels, thin film electro-luminescent disp

Relation between 2-D Euclidean system and Homogeneous coordinate system Suppose that P(x,y) be any point in 2-D Euclidean system. In HCS, we add a third coordinate to the poin

Removing Polygons Hidden through a Surrounding Polygon: The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding

what do you means by bresenham s him algorithm