Scribd
Upload
57 views5 pages

Bradenham's Line Algorithm

The Bradenham's Line algorithm generates points along a line between two given points (x1,y1) and (x2,y2) in 8 steps. It calculates slope, increments, and checks if the current point is past the ending point before generating the next point and drawing it. The circle algorithm generates points along a circle of radius r centered at the origin using a decision parameter p to determine if the next point is (x+1, y) or (x+1, y-1). The ellipse algorithm generates points along an ellipse with given radii along the x and y axes using different decision parameters p1 and p2 for the top and bottom regions to iteratively determine the

Uploaded by

Farzana Riaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
57 views5 pages

Bradenham's Line Algorithm

The Bradenham's Line algorithm generates points along a line between two given points (x1,y1) and (x2,y2) in 8 steps. It calculates slope, increments, and checks if the current point is past the ending point before generating the next point and drawing it. The circle algorithm generates points along a circle of radius r centered at the origin using a decision parameter p to determine if the next point is (x+1, y) or (x+1, y-1). The ellipse algorithm generates points along an ellipse with given radii along the x and y axes using different decision parameters p1 and p2 for the top and bottom regions to iteratively determine the

Uploaded by

Farzana Riaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Bradenham's Line

Algorithm:
Step1: Start Algorithm
Step2: Declare variable x1,x2,y1,y2,d,i1,i2,dx,dy
Step3: Enter value of x1,y1,x2,y2
                Where x1,y1are coordinates of starting point
                And x2,y2 are coordinates of Ending point
Step4: Calculate dx = x2-x1
                Calculate dy = y2-y1
                Calculate i1=2*dy
                Calculate i2=2*(dy-dx)
                Calculate d=i1-dx

Step5: Consider (x, y) as starting point and xendas maximum possible value of x.


                If dx < 0
                        Then x = x2
                        y = y2
                          xend=x1
                If dx > 0
                    Then x = x1
                y = y1
                        xend=x2
Step6: Generate point at (x,y)coordinates.
Step7:Check if whole line is generated.
                If x > = xend
                Stop.
Step8: Calculate co-ordinates of the next pixel
                If d < 0
                    Then d = d + i1
                If d ≥ 0
          Then d = d + i2
                Increment y = y + 1
Step9: Increment x = x + 1
Step10: Draw a point of latest (x, y) coordinates
Step11: Go to step 7
Step12: End of Algorithm
Circle algorithm
) )
Step1: Put x =0, y =r in eq: Pi=f (xi+1,yi- 1/2 = (xi+1)2+(yi-1/2 2-r2
            We have p=1-r

Step2: Repeat steps while x ≤ y


            Plot (x, y)
            If (p<0)
Then set p = p + 2x + 3
Else
            p = p + 2(x-y)+5
            y =y - 1 (end if)
            x =x+1 (end loop)
Step3: End
Ellipse alogorithm
1) Take input radius along x axis and y axis and obtain center of ellipse.
2) Initially, we assume ellipse to be centered at origin and the first point as : (x, y0)= (0,
ry).
3) Obtain the initial decision parameter for region 1 as: p10=ry2+1/4rx2-rx 2ry
4) For every xk position in region 1 : 
If p1k<0 then the next point along the is (xk+1 , yk) and p1k+1=p1k+2ry2xk+1+ry2
Else, the next point is (xk+1, yk-1 ) 
And p1k+1=p1k+2ry2xk+1 – 2rx2yk+1+ry2
5) Obtain the initial value in region 2 using the last point (x0, y0) of region 1 as:
p20=ry2(x0+1/2)2+rx2 (y0-1)2-rx2ry2
6) At each yk in region 2 starting at k =0 perform the following task. 
If p2k>0 the next point is (xk, yk-1) and p2k+1=p2k-2rx2yk+1+rx2
7) Else, the next point is (xk+1, yk -1) and p2k+1=p2k+2ry2xk+1 -2rx2yk+1+rx2
8) Now obtain the symmetric points in the three quadrants and plot the coordinate
value as: x=x+xc, y=y+yc
9) Repeat the steps for region 1 until 2ry2x>=2rx2y

You might also like