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

Storing information structures in display memory, What is the major disadva...

What is the major disadvantages of storing information structures in display memory? A major disadvantage of storing information structures in display memory is that when color an

Find out average unit normal vector at each polygon vertex, To find out ave...

To find out average unit normal vector at each polygon vertex At each polygon vertex as demonstrated by point V in the figure above, the normal vector is acquired by averaging

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.

Implement the scan line polygon fill algorithm, Implement the Scan line pol...

Implement the Scan line polygon fill algorithm for any arbitrary polygon in C-language and then use your code to fill each of the following type of polygon. i)  Convex polygon

Art-applications for computer animation, Art: it just like conventional an...

Art: it just like conventional animation, computer animation is additionally a type of art. A multitude of results can be created on a computer than on a piece of paper. An artist

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

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

Explain advantages of rendering polygons by scan line method, What are the ...

What are the advantages of rendering polygons by scan line method?  i. The max and min values of the scan were simply found.  ii. The intersection of scan lines with edges i

What are the features found in CAD, What are the features found in CAD ...

What are the features found in CAD Features generally found in a CAD package involve: - 2D and 3D modelling - Wire frame - Library of parts that can be used in new dra

Different types of parallel and perspective projection, Q.   Describe diffe...

Q.   Describe different types of parallel and perspective projection used in computer graphics.

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