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

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

Demerit - phong shading or normal vector interpolation shadi, Demerit - pho...

Demerit - phong shading or normal vector interpolation shading Needs lot of computations to determine intensity at a point, hence increases the cost of shading in any impleme

What is computer graphics?, What Is Computer Graphics? The term Graphi...

What Is Computer Graphics? The term Graphics mean is Graphical Tricks. All image or picture is actually a graph and when various mathematical tricks are utilized to manipulate

Various ways of simulating motion, Various ways of simulating motion:- ...

Various ways of simulating motion:- -        Zero Acceleration (Constant Speed)           -        Non-Zero Accelerations -        Positive accelerations

Forensics-applications for computer animation, Forensics: Accidents occur ...

Forensics: Accidents occur every minute. Very frequently, there are no witnesses except for the individuals concerned in the accident or worse yet, there are no surviving witnesse

Two point and three point perspective transformations, Two-Point and Three-...

Two-Point and Three-Point Perspective transformations The two-point perspective projection can be acquired by rotating about one of the principal axis only and projecting upon

How is sampling done, Image Processing 1. How is sampling done? Explain...

Image Processing 1. How is sampling done? Explain quantization in digital image processing? 2. Explain in brief: (1) Image Subtraction (ii) Image averaging. 3. Explain in

Sutherland hodgman algorithm, Sutherland-Hodgman Algorithm Any polygon...

Sutherland-Hodgman Algorithm Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the po

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