## C graphics program for analog clock

Time_Dig[0]=hour/10+48;

Time_Dig[1]=hour%10+48;

Time_Dig[2]=’:’;

Time_Dig[3]=min/10+48;

Time_Dig[4]=min%10+48;

Time_Dig[5]=’:’;

Time_Dig[6]=sec/10+48;

October 2nd, 2009

7 Comments

Time_Dig[0]=hour/10+48;

Time_Dig[1]=hour%10+48;

Time_Dig[2]=’:’;

Time_Dig[3]=min/10+48;

Time_Dig[4]=min%10+48;

Time_Dig[5]=’:’;

Time_Dig[6]=sec/10+48;

October 2nd, 2009

10 Comments

setcolor (WHITE);

line (pt[0][0], pt[0][1], pt[1][0], pt[1][1]);

line (pt[1][0], pt[1][1], pt[2][0], pt[2][1]);

line (pt[2][0], pt[2][1], pt[0][0], pt[0][1]);

getch();

October 2nd, 2009

5 Comments

C Program to implement 3-D rotation with respect to x-axis, y-axis and z-axis (wire frame model of a cube). Use appropriate data structures to manipulate the wire frame model.

October 2nd, 2009

5 Comments

double xt = pow (1-t, 3) * x[0] + 3 * t * pow (1-t, 2) * x[1] +

3 * pow (t, 2) * (1-t) * x[2] + pow (t, 3) * x[3];

double yt = pow (1-t, 3) * y[0] + 3 * t * pow (1-t, 2) * y[1] +

3 * pow (t, 2) * (1-t) * y[2] + pow (t, 3) * y[3];

October 2nd, 2009

30 Comments

C Program to implement the Cohen-Sutherland line-clipping algorithm. Make provision to specify the input line, window for clipping and view port for displaying the clipped image. (Use built-in line and rectangle functions).

October 2nd, 2009

1 Comment

C Program to draw a rectangle and perform the following operations.

a. Rotation about the origin followed by translation.

b. Rotation about an arbitrary point.

c. Apply X shear and Y shear on the rectangle.

October 2nd, 2009

2 Comments

Program to display a line graph using midpoint line algorithm. The input to the program is a set of data corresponding to the X and Y-axes. Data parts are to be displayed as asterisk (*) according to the input specification.

October 2nd, 2009

4 Comments

Program to implement the Midpoint Line algorithm to generate a line of given slope and thickness. Implement the polyline (many lines) command using this algorithm as a routine that display a set of straight lines between N input points. For n=1 the routine displays a single point.

October 2nd, 2009

22 Comments

line(80+i,300,90+i,270);

line(90+i,270,120+i,270);

line(120+i,270,160+i,240);

line(160+i,240,230+i,240);

line(230+i,240,275+i,270);

October 2nd, 2009

5 Comments

theta=M_PI*angle/180;

x[i]=xc+r*cos(theta);

y[i]=yc+r*sin(theta);

angle+=20;

line(xc,yc,x[i],y[i]);

October 2nd, 2009