Algorithms for basic line segment plotting, Computer Graphics

Assignment Help:

Algorithms for Basic Line Segment Plotting

There are two important algorithms for basic line segment plotting-DDA algorithm and Bresenham algorithm.  Both the algorithms use the form y = mx + c of the line segment. 

Whereas DDA uses floating point calculations to determine iteratively the pixel positions, Bresenham algorithm is based purely on integer calculation. Therefore, Bresenham algorithm is more efficient and faster.

However, in the literature, you may find modified DDA algorithm that uses integer calculation only.


Related Discussions:- Algorithms for basic line segment plotting

Physx, what is physx.?

what is physx.?

Types of bitmap images, Types of Bitmap Images Bitmap images can includ...

Types of Bitmap Images Bitmap images can include any number of colours but we distinguish among four main categories as: 1)      Line-art: These are images that include

How does resolution of a system influence graphic display, 1. How does the...

1. How does the resolution of a system influence graphic display? Ans. In a high resolution system the adjacent pixels are so near spaced such approximated line-pixels lie extr

Target market before doing a design work, Question: (a) Explain the i...

Question: (a) Explain the importance of knowing and understanding your target market before doing a design work. Use example(s) to enhance your answer. (b) Describe the

Crt, crt is an analog or digital device

crt is an analog or digital device

Draw the letters s, Draw the letters S, P, R or U of English alphabet using...

Draw the letters S, P, R or U of English alphabet using multiple Bézier curves.  A complete code for plotting Bezier curves is given previously. There in the code, control point

Education, Education, Training, Entertainment and Computer Aided Design ...

Education, Training, Entertainment and Computer Aided Design CAD or CADD is an acronym which depending upon who you ask, can stand for: I. Computer Assisted Design. II.

Polygon filling algorithm - raster graphics and clipping, Polygon Filling A...

Polygon Filling Algorithm - Raster Graphics and Clipping In several graphics displays, this becomes essential to differentiate between different regions by filling them along

Area subdivision method-obscures the continuing two surface, Assume here ar...

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5) And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

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