Anonymous user
Total circles area: Difference between revisions
→{{header|C}}: reduce globals; speed; cropped data list
m (→{{header|C}}: reduce unnecessary comparisons) |
(→{{header|C}}: reduce globals; speed; cropped data list) |
||
Line 166:
<lang c>#include <stdio.h>
#include <math.h>
#include <stdlib.h>
typedef double F;
typedef struct { F x, y, r, r2, y0, y1; } circle;
circle circles[] = {
{ 1.6417233788, 1.6121789534, 0.0848270516},...
/* data snipped for space, copy from previous example */
};▼
inline F min(F a, F b) { return a < b ? a : b; }
Line 202 ⟶ 181:
typedef struct { F x0, x1; } sect_t;
sect_t sect[sizeof(circles) / sizeof(circle)];▼
inline void swap_s(int i, int j) {▼
sect_t ss;▼
ss = sect[i], sect[i] = sect[j], sect[j] = ss;▼
▲}
F spans(circle *c, int n_circs, F ymin, F step, F ymax)
{
F y, total = 0;
int i, j, n, row = 1 + ceil((ymax - ymin) / step);
▲ inline void swap_s(int i, int j) {
}
inline void swap_c(int i, int j) {
Line 217 ⟶ 196:
cc = c[i], c[i] = c[j], c[j] = cc;
}
for (i = 0; i < n_circs; i++)
for (j = i + 1; j < n_circs; j++)
if (c[i].y1 < c[j].y1) swap_c(i, j);
while (row--) {
Line 222 ⟶ 205:
for (n = n_circs, i = 0; i < n; ) {
if (y >= c[i].y1)
else if (y <= c[i].y0) {
for (j = i + 1; j < n_circs; j++) c[j-1] = c[j];
c[--n_circs] = cc;
--n;
} else {
Line 255 ⟶ 240:
}
}
free(sect);
return total;
}
Line 282 ⟶ 268:
int s = 1 << 20; // Definitely overkill. Definitely.
printf("area = %.10f at\t%d scanlines\n",
spans(circles, n_circs, floor(miny * s) / s, 1./s, maxy) / s,
(int)((maxy - floor(miny * s) / s) * s));
| |||