PostGIS  2.5.1dev-r@@SVN_REVISION@@

◆ lw_dist2d_seg_seg()

int lw_dist2d_seg_seg ( const POINT2D A,
const POINT2D B,
const POINT2D C,
const POINT2D D,
DISTPTS dl 
)

Finds the shortest distance between two segments.

This function is changed so it is not doing any comparison of distance but just sending every possible combination further to lw_dist2d_pt_seg

Definition at line 1820 of file measures.c.

References DIST_MAX, DIST_MIN, DISTPTS::distance, lw_dist2d_pt_seg(), LW_FALSE, LW_TRUE, LWDEBUGF, DISTPTS::mode, DISTPTS::p1, DISTPTS::p2, r, s, DISTPTS::twisted, POINT2D::x, and POINT2D::y.

Referenced by lw_dist2d_arc_arc(), lw_dist2d_ptarray_ptarray(), lw_dist2d_seg_arc(), and rect_leaf_node_distance().

1821 {
1822  double s_top, s_bot,s;
1823  double r_top, r_bot,r;
1824 
1825  LWDEBUGF(2, "lw_dist2d_seg_seg [%g,%g]->[%g,%g] by [%g,%g]->[%g,%g]",
1826  A->x,A->y,B->x,B->y, C->x,C->y, D->x, D->y);
1827 
1828  /*A and B are the same point */
1829  if ( ( A->x == B->x) && (A->y == B->y) )
1830  {
1831  return lw_dist2d_pt_seg(A,C,D,dl);
1832  }
1833  /*U and V are the same point */
1834 
1835  if ( ( C->x == D->x) && (C->y == D->y) )
1836  {
1837  dl->twisted= ((dl->twisted) * (-1));
1838  return lw_dist2d_pt_seg(D,A,B,dl);
1839  }
1840  /* AB and CD are line segments */
1841  /* from comp.graphics.algo
1842 
1843  Solving the above for r and s yields
1844  (Ay-Cy)(Dx-Cx)-(Ax-Cx)(Dy-Cy)
1845  r = ----------------------------- (eqn 1)
1846  (Bx-Ax)(Dy-Cy)-(By-Ay)(Dx-Cx)
1847 
1848  (Ay-Cy)(Bx-Ax)-(Ax-Cx)(By-Ay)
1849  s = ----------------------------- (eqn 2)
1850  (Bx-Ax)(Dy-Cy)-(By-Ay)(Dx-Cx)
1851  Let P be the position vector of the intersection point, then
1852  P=A+r(B-A) or
1853  Px=Ax+r(Bx-Ax)
1854  Py=Ay+r(By-Ay)
1855  By examining the values of r & s, you can also determine some other limiting conditions:
1856  If 0<=r<=1 & 0<=s<=1, intersection exists
1857  r<0 or r>1 or s<0 or s>1 line segments do not intersect
1858  If the denominator in eqn 1 is zero, AB & CD are parallel
1859  If the numerator in eqn 1 is also zero, AB & CD are collinear.
1860 
1861  */
1862  r_top = (A->y-C->y)*(D->x-C->x) - (A->x-C->x)*(D->y-C->y);
1863  r_bot = (B->x-A->x)*(D->y-C->y) - (B->y-A->y)*(D->x-C->x);
1864 
1865  s_top = (A->y-C->y)*(B->x-A->x) - (A->x-C->x)*(B->y-A->y);
1866  s_bot = (B->x-A->x)*(D->y-C->y) - (B->y-A->y)*(D->x-C->x);
1867 
1868  if ( (r_bot==0) || (s_bot == 0) )
1869  {
1870  if ((lw_dist2d_pt_seg(A,C,D,dl)) && (lw_dist2d_pt_seg(B,C,D,dl)))
1871  {
1872  dl->twisted= ((dl->twisted) * (-1)); /*here we change the order of inputted geometries and that we notice by changing sign on dl->twisted*/
1873  return ((lw_dist2d_pt_seg(C,A,B,dl)) && (lw_dist2d_pt_seg(D,A,B,dl))); /*if all is successful we return true*/
1874  }
1875  else
1876  {
1877  return LW_FALSE; /* if any of the calls to lw_dist2d_pt_seg goes wrong we return false*/
1878  }
1879  }
1880 
1881  s = s_top/s_bot;
1882  r= r_top/r_bot;
1883 
1884  if (((r<0) || (r>1) || (s<0) || (s>1)) || (dl->mode == DIST_MAX))
1885  {
1886  if ((lw_dist2d_pt_seg(A,C,D,dl)) && (lw_dist2d_pt_seg(B,C,D,dl)))
1887  {
1888  dl->twisted= ((dl->twisted) * (-1)); /*here we change the order of inputted geometries and that we notice by changing sign on dl->twisted*/
1889  return ((lw_dist2d_pt_seg(C,A,B,dl)) && (lw_dist2d_pt_seg(D,A,B,dl))); /*if all is successful we return true*/
1890  }
1891  else
1892  {
1893  return LW_FALSE; /* if any of the calls to lw_dist2d_pt_seg goes wrong we return false*/
1894  }
1895  }
1896  else
1897  {
1898  if (dl->mode == DIST_MIN) /*If there is intersection we identify the intersection point and return it but only if we are looking for mindistance*/
1899  {
1900  POINT2D theP;
1901 
1902  if (((A->x==C->x)&&(A->y==C->y))||((A->x==D->x)&&(A->y==D->y)))
1903  {
1904  theP.x = A->x;
1905  theP.y = A->y;
1906  }
1907  else if (((B->x==C->x)&&(B->y==C->y))||((B->x==D->x)&&(B->y==D->y)))
1908  {
1909  theP.x = B->x;
1910  theP.y = B->y;
1911  }
1912  else
1913  {
1914  theP.x = A->x+r*(B->x-A->x);
1915  theP.y = A->y+r*(B->y-A->y);
1916  }
1917  dl->distance=0.0;
1918  dl->p1=theP;
1919  dl->p2=theP;
1920  }
1921  return LW_TRUE;
1922  }
1923 }
char * r
Definition: cu_in_wkt.c:24
int mode
Definition: measures.h:51
POINT2D p1
Definition: measures.h:49
double x
Definition: liblwgeom.h:330
#define DIST_MIN
Definition: measures.h:41
#define LW_FALSE
Definition: liblwgeom.h:76
#define LW_TRUE
Return types for functions with status returns.
Definition: liblwgeom.h:75
int lw_dist2d_pt_seg(const POINT2D *p, const POINT2D *A, const POINT2D *B, DISTPTS *dl)
lw_dist2d_comp from p to line A->B This one is now sending every occasion to lw_dist2d_pt_pt Before i...
Definition: measures.c:2205
POINT2D p2
Definition: measures.h:50
double y
Definition: liblwgeom.h:330
char * s
Definition: cu_in_wkt.c:23
int twisted
Definition: measures.h:52
double distance
Definition: measures.h:48
#define DIST_MAX
Definition: measures.h:40
#define LWDEBUGF(level, msg,...)
Definition: lwgeom_log.h:88
Here is the call graph for this function:
Here is the caller graph for this function: