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

Matrix for orthographic projection, Matrix for Orthographic Projection ...

Matrix for Orthographic Projection Orthographic projections are projections into one of the coordinate planes x=0, y=0or z=0. The matrix for orthographic projection on the z=0

Application areas of computer graphics, Explain application areas of comput...

Explain application areas of computer graphics in different areas.    Early computer graphics has only certain special capabilities such as straight lines circles and ellipses

Explain briefly ancillary operations, Problem: a. Explain briefly six A...

Problem: a. Explain briefly six Ancillary Operations? b. When do ancillary operations take place? c. (i) What is flexography? (ii) Provide examples of finished produ

Education and training systems multimedia in education, Education and train...

Education and training systems are making with three major objectives as: a) The learning objectives and purpose of the training. b)  Assessment or testing of the students to

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

Ellipse generating algorithm, Ellipse generating algorithm: Algorithm ...

Ellipse generating algorithm: Algorithm is similar to circle algorithm. We divide the ellipse on the positive quadrant into two regions. Region 1 where the slope > -1, and Reg

Rotation about the origin - 2-d and 3-d transformations, Rotation about the...

Rotation about the origin - 2-d and 3-d transformations Specified a 2-D point P(x,y), which we need to rotate, along with respect to the origin O. The vector OP has a length '

Object space - approaches for visible surface determination, Object Space -...

Object Space - approaches for visible surface determination The second approach as object-space that compares all objects directly along with each other inside the scene defin

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