44 Points2->
x[0], Points2->
y[0], Points2->
z[0],
51 Points2->
z[Points2->
n_points - 1], with_z);
56 Points2->
x[0], Points2->
y[0],
57 Points2->
z[0], with_z);
69 for (i = 0; i <
sizeof(distances) /
sizeof(
double); i++) {
70 if (distances[i] >= 0.0 && distances[i] < distances[*mindistidx])
74 G_debug(3,
"Vedit_get_min_distance(): dists=%f,%f,%f,%f",
75 distances[0], distances[1], distances[2], distances[3]);
77 return distances[*mindistidx];
int n_points
Number of points.
double Vect_points_distance(double, double, double, double, double, double, int)
Calculate distance of 2 points.
double * x
Array of X coordinates.
Feature geometry info - coordinates.
double * y
Array of Y coordinates.
double Vedit_get_min_distance(struct line_pnts *Points1, struct line_pnts *Points2, int with_z, int *mindistidx)
Calculate distances between two lines.
double * z
Array of Z coordinates.
int G_debug(int, const char *,...) __attribute__((format(printf