Bresenham's line drawing algorithm
A line segment is defined by an infinite set of points which lie between two points; these points have no area. A problem occurs, however, when drawing lines on a computer screen, namely that we have to approximate the line with pixels which are not infinitely small, and which are limited to fixed positions based on the screen resolution. A simple line drawing algorithm can be implemented as, filename dda.py from Tkinter import * import math #defining main function def main(): #reading end points of line x0 = int(raw_input("ENTER THE Xo : ")) y0 = int(raw_input("ENTER THE Yo : ")) x1 = int(raw_input("ENTER THE Xn : ")) y1 = int(raw_input("ENTER THE Yn : ")) root = Tk() pic = PhotoImage(width=800,height=800) lb = Label(root,image=pic) lb.pack() color = "blue" dx = x2 – x1; dy = y2 – y1; m = dy/dx for x in range(x1,x2) y = m*x + y1 + 0.5; pic.put(color(x, y))...