Using Bresenham’s algorithm, generate the coordinates of the pixels that lie on a line segment having the endpoints (2, 3) and (5, 8). Case: When slope (m) > 1 Now let’s solve the same numerical using BLA Algorithm. S-1: x1=2; y1=3; x2=5; y2=8. S-2: dy=y2-y1 8-3= 5 and dx = x2-x1 = 5-2 = 3 […]
Example-1 Draw a circle using Midpoint Circle Algorithm having radius as 10 and center of circle (100,100). Important points: Starting d =5/4-r but as 5/4 is approximately equal to 1 so initial d would be d=1-r. Plotted one pixel will generate 7 other points, because of 8 way symmetry. The Algorithm: S-1: Assume the coordinates […]
Numerical of Bresenham’s Circle Algorithm Bresenham’s Circle Algorithm Draw a circle using BCA having radius as 10 and center of circle (100,100). S-1; Enter the center h=100, k=100 and radius r=10. S-2: Find d=3-2*(10)= -17 and take x = 0 , y = 10 ; S-3: If (d>=0) then x = x +1 and y […]
Let us understand how DDA Algorithm works by taking some examples and solving them too. Just keep in mind two things one, Y=mx+b is the line equation. Second, If m is less than one increase X and calculate Y. If m is more than 1 then increase Y and calculate X. DDA Algorithm is explained […]
We have disabled - Right- Click - How about stay to read :)