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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
| #include <stdarg.h>
#include <kdt/kdt.h>
#pragma autolink -L$BASILISK/kdt -lkdt
@if _OPENMP
@ define NPROC omp_get_max_threads()
@ define PROC tid()
@else
@ define NPROC 1
@ define PROC 0
@endif
attribute {
void ** kdt;
scalar nt, dmin, dmax;
}
static int includes_point (KdtRect rect, Point point)
{
Delta_x /= 2.; Delta_y /= 2.;
return (rect[0].l >= x - Delta_x && rect[0].h <= x + Delta_x &&
rect[1].l >= y - Delta_y && rect[1].h <= y + Delta_y);
}
static int includes (KdtRect rect, Point * p)
{
return includes_point (rect, *p);
}
static int intersects_point (KdtRect rect, Point point)
{
Delta_x /= 2.; Delta_y /= 2.;
return (rect[0].l <= x + Delta_x && rect[0].h >= x - Delta_x &&
rect[1].l <= y + Delta_y && rect[1].h >= y - Delta_y);
}
static int intersects (KdtRect rect, Point * p)
{
return intersects_point (rect, *p);
}
static void reconstruct_terrain (Point point, scalar zb)
{
KdtSum s;
kdt_sum_init (&s);
Delta_x /= 2.; Delta_y /= 2.;
KdtRect rect = {{x - Delta_x, x + Delta_x},
{y - Delta_y, y + Delta_y}};
for (Kdt ** kdt = (Kdt **) zb.kdt[PROC]; *kdt; kdt++)
kdt_query_sum (*kdt,
(KdtCheck) includes,
(KdtCheck) intersects, &point,
rect, &s);
scalar n = zb.nt, dmin = zb.dmin, dmax = zb.dmax;
n[] = s.n;
if (s.w > 0.) {
zb[] = s.H0/s.w;
dmin[] = s.Hmin;
dmax[] = s.Hmax;
}
else {
/* not enough points in database, use bilinear interpolation
from coarser level instead */
if (level > 0)
zb[] = (9.*coarse(zb,0,0) +
3.*(coarse(zb,child.x,0) + coarse(zb,0,child.y)) +
coarse(zb,child.x,child.y))/16.;
else
zb[] = 0.; // no points at level 0!
dmin[] = nodata;
dmax[] = nodata;
}
}
void refine_terrain (Point point, scalar zb)
{
foreach_child()
reconstruct_terrain (point, zb);
}
static void delete_terrain (scalar zb)
{
for (int i = 0; i < NPROC; i++) {
for (Kdt ** kdt = (Kdt **) zb.kdt[i]; *kdt; kdt++)
kdt_destroy (*kdt);
free (zb.kdt[i]);
}
free (zb.kdt);
}
@define CHARP char * // fixme: workaround for va_arg macro
void terrain (scalar zb, ...)
{
zb.kdt = qcalloc (NPROC, void *);
zb.delete = delete_terrain;
int nt = 0;
va_list ap;
va_start (ap, zb);
char * name;
while ((name = va_arg (ap, CHARP))) {
for (int i = 0; i < NPROC; i++) {
Kdt ** kdt = (Kdt **) zb.kdt[i];
zb.kdt[i] = qrealloc (kdt, nt + 2, Kdt *);
kdt[nt] = kdt_new();
kdt[nt + 1] = NULL;
char * fname = name;
if (name[0] == '~') {
char * home = getenv ("HOME");
if (home != NULL) {
fname = malloc(sizeof(char)*(strlen(home) + strlen(name)));
strcpy (fname, home);
strcat (fname, name + 1);
}
}
if (kdt_open (kdt[nt], fname)) {
fprintf (stderr, "terrain: could not open terrain database '%s'\n",
fname);
exit (1);
}
if (fname != name)
free (fname);
}
nt++;
}
va_end (ap);
scalar n = new scalar;
scalar dmin = new scalar;
scalar dmax = new scalar;
zb.nt = n;
zb.dmin = dmin;
zb.dmax = dmax;
#if TREE
zb.refine = refine_terrain;
n.refine = no_restriction;
n.restriction = no_restriction;
dmin.refine = no_restriction;
dmin.restriction = no_restriction;
dmax.refine = no_restriction;
dmax.restriction = no_restriction;
#endif
trash ({zb});
for (int l = 0; l <= depth(); l++) {
foreach_level (l)
reconstruct_terrain (point, zb);
boundary_level ({zb}, l);
}
}
|
