1118{
1119
1121 int rv;
1124
1125
1127
1128
1133 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, 1, 0.000001);
1134
1135
1140 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, 1, 0.000001);
1141
1142
1143 P.
y = P.
x = 2 * cos(M_PI_4);
1147 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, 1, 0.000001);
1148
1149
1152
1153
1158 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, sqrt(2.0), 0.000001);
1159
1160
1165 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, 1, 0.000001);
1166
1167
1168 P.
x = -1.5; P.
y = 0;
1172 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, 0.5, 0.000001);
1173
1174
1175 P.
x = -2.5; P.
y = 0;
1179 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, 0.5, 0.000001);
1180
1181
1182 P.
y = -2.5; P.
x = 0;
1186 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, 0.5, 0.000001);
1187
1188
1193 CU_ASSERT_DOUBLE_EQUAL(dl.
distance, sqrt(2.0)-1.0, 0.000001);
1194
1195
1197}
static LWGEOM * lwgeom_from_text(const char *str)
LWLINE * lwgeom_as_lwline(const LWGEOM *lwgeom)
void lwline_free(LWLINE *line)
void lw_dist2d_distpts_init(DISTPTS *dl, int mode)
int lw_dist2d_pt_ptarrayarc(const POINT2D *p, const POINTARRAY *pa, DISTPTS *dl)
Search all the arcs of pointarray to see which one is closest to p1 Returns minimum distance between ...
Structure used in distance-calculations.