33 Box->
E = Points->
x[0];
34 Box->
W = Points->
x[0];
35 Box->
N = Points->
y[0];
36 Box->
S = Points->
y[0];
37 Box->
T = Points->
z[0];
38 Box->
B = Points->
z[0];
40 for (i = 1; i < Points->
n_points; i++) {
41 if (Points->
x[i] > Box->
E)
42 Box->
E = Points->
x[i];
43 else if (Points->
x[i] < Box->
W)
44 Box->
W = Points->
x[i];
46 if (Points->
y[i] > Box->
N)
47 Box->
N = Points->
y[i];
48 else if (Points->
y[i] < Box->
S)
49 Box->
S = Points->
y[i];
51 if (Points->
z[i] > Box->
T)
52 Box->
T = Points->
z[i];
53 else if (Points->
z[i] < Box->
B)
54 Box->
B = Points->
z[i];
int dig_line_box(const struct line_pnts *Points, struct bound_box *Box)
int dig_box_extend(struct bound_box *A, struct bound_box *B)
float Box[8][3]
Vertices for box.
int n_points
Number of points.
double * x
Array of X coordinates.
Feature geometry info - coordinates.
double * y
Array of Y coordinates.
void G_zero(void *, int)
Zero out a buffer, buf, of length i.
double * z
Array of Z coordinates.
int dig_box_copy(struct bound_box *A, struct bound_box *B)