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

Variation of intensity - modeling and rendering, Variation of Intensity - M...

Variation of Intensity - Modeling and Rendering According to the phong model the variation of Intensity (I) along with α (since I α cos n α) is: i) for shiny surface (

Explain parallel and perspective projection, Distinguish between parallel a...

Distinguish between parallel and perspective projection Parallel Projection Perspective projection Coordinate position are transformed

Advantages of the z-buffer method, Advantages of the z-buffer method:      ...

Advantages of the z-buffer method:              1) The z-buffer method or algorithm is easy to apply and it needs no sorting of surface in a scene. 2) In z-buffer algorithm

Construction of a solid with a translational sweep, Construction of a Solid...

Construction of a Solid with a Translational Sweep Figure demonstrates construction of a solid along with a translational sweep. Translating the control points of the periodic

Displacement mapping, Implement displacement mapping and bump mapping on a ...

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

Parallel projection, Parallel Projection In parallel projection, object...

Parallel Projection In parallel projection, objects in scene are projected onto the 2D view plane along rays parallel to a projection vector. Parallel projection is orthogra

Parametric continuity conditions , Parametric Continuity Conditions   To e...

Parametric Continuity Conditions   To ensure a smooth transitions from one section of a piecewise parametric curve to the next, we can impose various continuity conditions at the

Image precision, what is image precision in computer graphics

what is image precision in computer graphics

Reflection and shear - output primitives, Reflection and Shear There ar...

Reflection and Shear There are a few important transformations which are not primitive in the sense that they can be expressed as compositions of translation, rotation and scal

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