This repository has been archived by the owner on Nov 16, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathdonut.c
55 lines (51 loc) · 1.79 KB
/
donut.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
// gcc donut.c -lm -o donut
int k;
const float theta_spacing = 0.07; // θ 角度,圆环的横截面圆,Y轴
const float phi_spacing = 0.02; // φ 角度,圆环的旋转中心,Z轴
int main() {
float A = 0;
float B = 0;
float i, j;
float zbuff[1760]; // Z buffer of 80 * 22
char b[1760]; // chars of 80 * 22
printf("\x1b[2J"); // clear screen
for (;;) {
memset(b, 32, 1760);
memset(zbuff, 0, 7040);
// theta goes around the cross-sectional circle of a torus
for (j = 0; 6.28 > j; j += theta_spacing)
// phi goes around the center of revolution of a torus
for (i = 0; 6.28 > i; i += phi_spacing) {
float c = sin(i);
float d = cos(j);
float e = sin(A);
float f = sin(j);
float g = cos(A);
float h = d + 2;
float D = 1 / (c * h * e + f * g + 5);
float l = cos(i);
float m = cos(B);
float n = sin(B);
float t = c * h * g - f * e;
int x = 40 + 30 * D * (l * h * m - t * n);
int y = 12 + 15 * D * (l * h * n + t * m);
int o = x + 80 * y;
int N = 8 * ((f * e - c * d * g) * m - c * d * e - f * g -
l * d * n);
if (22 > y && y > 0 && x > 0 && 80 > x && D > zbuff[o]) {
zbuff[o] = D;
b[o] = ".,-~:;=!*#$@"[N > 0 ? N : 0];
}
}
printf("\x1b[H");
for (k = 0; 1761 > k; k++)
putchar(k % 80 ? b[k] : 10);
A += 0.04;
B += 0.02;
usleep(1000 * 10);
}
}