Implementation of Cohen Sutherland line clipping algorithm

Breshanham line drawing program

Implementation of Brashanham circle drawing algorithm

Bresenhams line drawing algorithm

#include #include #include #include void main() { int Xs,Ys,Xe,Ye,dx,dy; float X,Y,p; int gd=DETECT,gm ; initgraph(&gd,&gm,”C:\\tc\\bgi”); printf (“Enter the value of (Xs , Xs ) & (Xe , Ye)\n”); scanf (“%d%d%d%d”, &Xs ,&Ys , &Xe , &Ye); dy=Ye-Ys; dx=Xe-Xs; p=(2*dy)-dx; X=Xs; Y=Ys; cleardevice( ); putpixel(X,Y,YELLOW); while(X!=Xe && Y!=Ye) { if(p<1) { X=X+1; p=p+(2*dy); putpixel (X,Y,RED); } … Read more

Implementation of Bresenhams circle drawing algorithm

#include #include #include #include void main() { int r,x,y,p,xc=320,yc=240; int gd=DETECT,gm; initgraph(&gd,&gm,”C:\\TC\\BGI”); cleardevice(); printf(“Enter the radius “); scanf(“%d”,&r); putpixel(xc,yc,YELLOW); x=0; y=r; putpixel(xc+x,yc-y,1); p=3-(2*r); for(x=0;x<=y;x++) { if (p<0) { y=y; p=(p+(4*x)+6); } else { y=y-1; p=p+((4*(x-y)+10)); } putpixel(xc+x,yc-y,1); putpixel(xc-x,yc-y,2); putpixel(xc+x,yc+y,3); putpixel(xc-x,yc+y,4); putpixel(xc+y,yc-x,5); putpixel(xc-y,yc-x,6); putpixel(xc+y,yc+x,7); putpixel(xc-y,yc+x,8); } getch(); closegraph(); }