Scribd
Upload
16 views

Algorithms of Computer Graphics

The document discusses several algorithms used in computer graphics including DDA algorithm, Bresenham's line generation algorithm, and the mid-point algorithm. It also discusses how thousands of students have availed computer graphics assignment help through guided sessions.

Uploaded by

jack smith
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
16 views

Algorithms of Computer Graphics

The document discusses several algorithms used in computer graphics including DDA algorithm, Bresenham's line generation algorithm, and the mid-point algorithm. It also discusses how thousands of students have availed computer graphics assignment help through guided sessions.

Uploaded by

jack smith
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Algorithms of

Computer Graphics
Computer Graphics algorithm looking for it, then
you should connect with our experts to avail
computer graphics assignment help through
guided sessions. Our assignments would help you
score good and would also get your assignment
done in a jiffy.
DDA Algorithm
DDA algorithm is the most fundamental algorithm of Computer
Graphics. DDA stands for “Digital Differential Analyzer”. It is
both a hardware and software to interpolate variables across
intervals between the starting and the ending point. One can
realize shapes like Triangles, Polygons and lines with the help of
DDA. DDA may be extrapolated to draw polynomial functions and
quadratic curves. The simplest interpretation of the DDA
algorithm is DDA lines.

Equation of the line can be given as Xq = Xq?1 + 1, Yi = Yi?1 + m. In these


equations, m is the slope and can either be expressed as a DDA algorithm or
any other algorithms like Rasterization.
Bresenham’s Line Generation
It is a line drawing algorithm and helps
determine the points on the screen to be
used to plot lines by identifying n-
dimensional rasters to be selected in an
order that forms a close approximation of
a straight line. It uses simpler arithmetic
like integer calculations and avoids any
floating-point divisions or multiplications,
which saves time and space in terms of
computer resources. It takes unit
increments as it moves along the X-axis
and decides to choose the value of the
other axis, i.e., Y in this case at every
increment.
Mid-Point Algorithm
The Mid-Point algorithm arises from the concepts of the

Bresenham algorithm. Academicians like Pitteway and Van Aken

modified Brenham’s formula to invent the Mid-Point Algorithm.

Let us assume that we have a point P at coordinates x,y and

slope of the line is 0 ? m ? 1.

The algorithm would now determine if the next point is placed

at point E or at point N. This is decided by looking at the

intersection Q which is closest to the point N or either E. The

point that this intersection is closest to is considered as the


Thousands of Students Have Availed
Computer Graphics Assignment Help
through guided sessions From Us. You Should
Too!
Well, at My Assignment Services, we have experts to write your
computer graphic assignments for you and also help with your online
computer graphics projects assignments. Our experts are scholars that
are well versed with their subjects and also have over a decade of
experience in helping students with their university assignments.
Solutions are written by the score top-notch grades for students all
across the globe. Here are some perks of availing our online computer
graphics projects assignment help through guided sessions:
THANK-YOU !

You might also like