All cases covered Bresenham’s line-algorithm [closed]
Find the complete version: public void line(int x,int y,int x2, int y2, int color) { int w = x2 – x ; int h = y2 – y ; int dx1 = 0, dy1 = 0, dx2 = 0, dy2 = 0 ; if (w<0) dx1 = -1 ; else if (w>0) dx1 = 1 … Read more