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

Program to implement procedures or functions, The goal of this assignment i...

The goal of this assignment is to implement procedures/functions using x86 assembly. In addition to implementing procedures/functions, this assignment requires to pass arguments us

Dda or digital differential analyzer algorithm, DDA or Digital Differential...

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms From the above discussion we get that a Line drawing is accomplished through calculating intermedi

Put the system of a geometric data table for a 3d rectangle, Put the system...

Put the system of a geometric data table for a 3d rectangle. Solution : Vertex Table Edge Table Polygon Surface Table

Cases for digital differential analyzer algorithm, Cases for Digital Differ...

Cases for Digital Differential Analyzer Algorithm 1)  If in case 1, we plot the line another way round that is, moving in y direction via 1 unit every time and after that hunt

Jas file formats, JAS: The JAS file formats were implemented to form the s...

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

What are spot colours, Question 1: Name at least four file formats an...

Question 1: Name at least four file formats and explain in detail what they mean and how they are use? Question 2: What are "Process Colours"? Answer in a single para

Why are all resolutions in ratio of 4:3, Q. Why are all resolutions in rati...

Q. Why are all resolutions in ratio of 4:3? The bad news is that almost every monitor can only display upto a maximum of 262,144 colours (i.e.  18 bits/pixel Colour Depth). The

Interpolation of surface - polygon rendering, Interpolation of surface - Po...

Interpolation of surface - Polygon Rendering Interpolation of surface normals beside the polygonedge between two vertices is demonstrated above in the figure 15. Here the norm

Associative links, Associative Links: it is a link that is completely inde...

Associative Links: it is a link that is completely independent of the exact structure of the information. For illustration we have links depends on the meaning of various informat

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