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