1792 double dist_sqr, shortest_sqr;
1797 if (radius_A == radius_B)
1838 proj.
x = CENTER->
x + (B1->
x - CENTER->
x) * radius_A / radius_B;
1839 proj.
y = CENTER->
y + (B1->
y - CENTER->
y) * radius_A / radius_B;
1845 dl->
distance = fabs(radius_A - radius_B);
1849 proj.
x = CENTER->
x + (B3->
x - CENTER->
x) * radius_A / radius_B;
1850 proj.
y = CENTER->
y + (B3->
y - CENTER->
y) * radius_A / radius_B;
1855 dl->
distance = fabs(radius_A - radius_B);
1863 proj.
x = CENTER->
x + (A1->
x - CENTER->
x) * radius_B / radius_A;
1864 proj.
y = CENTER->
y + (A1->
y - CENTER->
y) * radius_B / radius_A;
1869 dl->
distance = fabs(radius_A - radius_B);
1874 proj.
x = CENTER->
x + (A3->
x - CENTER->
x) * radius_B / radius_A;
1875 proj.
y = CENTER->
y + (A3->
y - CENTER->
y) * radius_B / radius_A;
1880 dl->
distance = fabs(radius_A - radius_B);
1891 if (dist_sqr < shortest_sqr)
1893 shortest_sqr = dist_sqr;
1899 if (dist_sqr < shortest_sqr)
1901 shortest_sqr = dist_sqr;
1907 if (dist_sqr < shortest_sqr)
1909 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)