27 |
|
int reverse = 0; /* boolean true for reversed normals */ |
28 |
|
|
29 |
|
|
30 |
– |
|
30 |
|
static void |
31 |
|
vertex(int v) |
32 |
|
{ |
34 |
|
|
35 |
|
for (i = 0; i < 3; i++) { |
36 |
|
if (v & 010) |
37 |
< |
printf("\t%18.12g", v & 01 ? size[i]-bevel : bevel); |
37 |
> |
printf("\t%18.12g", (v&01)^reverse ? size[i]-bevel : bevel); |
38 |
|
else |
39 |
< |
printf("\t%18.12g", v & 01 ? size[i] : 0.0); |
39 |
> |
printf("\t%18.12g", (v&01)^reverse ? size[i] : 0.0); |
40 |
|
v >>= 1; |
41 |
|
} |
42 |
|
fputc('\n', stdout); |
49 |
|
printf("\n%s polygon %s.%c%c%c%c\n", cmtype, cname, |
50 |
|
let[a], let[b], let[c], let[d]); |
51 |
|
printf("0\n0\n12\n"); |
52 |
< |
if (reverse) { |
53 |
< |
vertex(d); |
54 |
< |
vertex(c); |
55 |
< |
vertex(b); |
57 |
< |
vertex(a); |
58 |
< |
} else { |
59 |
< |
vertex(a); |
60 |
< |
vertex(b); |
61 |
< |
vertex(c); |
62 |
< |
vertex(d); |
63 |
< |
} |
52 |
> |
vertex(a); |
53 |
> |
vertex(b); |
54 |
> |
vertex(c); |
55 |
> |
vertex(d); |
56 |
|
} |
57 |
|
|
58 |
|
|
62 |
|
printf("\n%s polygon %s.%c%c%c\n", cmtype, cname, |
63 |
|
let[a], let[b], let[c]); |
64 |
|
printf("0\n0\n9\n"); |
65 |
< |
if (reverse) { |
66 |
< |
vertex(c); |
67 |
< |
vertex(b); |
76 |
< |
vertex(a); |
77 |
< |
} else { |
78 |
< |
vertex(a); |
79 |
< |
vertex(b); |
80 |
< |
vertex(c); |
81 |
< |
} |
65 |
> |
vertex(a); |
66 |
> |
vertex(b); |
67 |
> |
vertex(c); |
68 |
|
} |
69 |
|
|
70 |
|
|