1782 double dist_sqr, shortest_sqr;
1787 if (radius_A == radius_B)
1828 proj.
x = CENTER->
x + (B1->
x - CENTER->
x) * radius_A / radius_B;
1829 proj.
y = CENTER->
y + (B1->
y - CENTER->
y) * radius_A / radius_B;
1835 dl->
distance = fabs(radius_A - radius_B);
1839 proj.
x = CENTER->
x + (B3->
x - CENTER->
x) * radius_A / radius_B;
1840 proj.
y = CENTER->
y + (B3->
y - CENTER->
y) * radius_A / radius_B;
1845 dl->
distance = fabs(radius_A - radius_B);
1853 proj.
x = CENTER->
x + (A1->
x - CENTER->
x) * radius_B / radius_A;
1854 proj.
y = CENTER->
y + (A1->
y - CENTER->
y) * radius_B / radius_A;
1859 dl->
distance = fabs(radius_A - radius_B);
1864 proj.
x = CENTER->
x + (A3->
x - CENTER->
x) * radius_B / radius_A;
1865 proj.
y = CENTER->
y + (A3->
y - CENTER->
y) * radius_B / radius_A;
1870 dl->
distance = fabs(radius_A - radius_B);
1881 if (dist_sqr < shortest_sqr)
1883 shortest_sqr = dist_sqr;
1889 if (dist_sqr < shortest_sqr)
1891 shortest_sqr = dist_sqr;
1897 if (dist_sqr < shortest_sqr)
1899 shortest_sqr = dist_sqr;
#define LW_TRUE
Return types for functions with status returns.
int lw_segment_side(const POINT2D *p1, const POINT2D *p2, const POINT2D *q)
lw_segment_side()
static double distance2d_sqr_pt_pt(const POINT2D *p1, const POINT2D *p2)