PostGIS  3.4.0dev-r@@SVN_REVISION@@

◆ lw_dist2d_line_poly()

int lw_dist2d_line_poly ( LWLINE line,
LWPOLY poly,
DISTPTS dl 
)

line to polygon calculation Brute force.

Test line-ring distance against each ring. If there's an intersection (distance==0) then return 0 (crosses boundary). Otherwise, test to see if any point is inside outer rings of polygon, but not in inner rings. If so, return 0 (line inside polygon), otherwise return min distance to a ring (could be outside polygon or inside a hole)

Definition at line 740 of file measures.c.

741 {
742  POINTARRAY *pa = line->points;
743  const POINT2D *pt = getPoint2d_cp(pa, 0);
744 
745  /* Line has a pount outside poly. Check distance to outer ring only. */
746  if (ptarray_contains_point(poly->rings[0], pt) == LW_OUTSIDE)
747  return lw_dist2d_ptarray_ptarray(pa, poly->rings[0], dl);
748 
749  for (uint32_t i = 1; i < poly->nrings; i++)
750  {
751  if (!lw_dist2d_ptarray_ptarray(pa, poly->rings[i], dl))
752  return LW_FALSE;
753 
754  /* just a check if the answer is already given */
755  if (dl->distance <= dl->tolerance && dl->mode == DIST_MIN)
756  return LW_TRUE;
757  }
758 
759  /* It's inside a hole, then the actual distance is the min ring distance */
760  for (uint32_t i = 1; i < poly->nrings; i++)
761  if (ptarray_contains_point(poly->rings[i], pt) != LW_OUTSIDE)
762  return LW_TRUE;
763 
764  /* Not in hole, so inside polygon */
765  if (dl->mode == DIST_MIN)
766  {
767  dl->distance = 0.0;
768  dl->p1.x = dl->p2.x = pt->x;
769  dl->p1.y = dl->p2.y = pt->y;
770  }
771  return LW_TRUE;
772 }
#define LW_FALSE
Definition: liblwgeom.h:94
#define LW_TRUE
Return types for functions with status returns.
Definition: liblwgeom.h:93
int ptarray_contains_point(const POINTARRAY *pa, const POINT2D *pt)
Return 1 if the point is inside the POINTARRAY, -1 if it is outside, and 0 if it is on the boundary.
Definition: ptarray.c:753
#define LW_OUTSIDE
static const POINT2D * getPoint2d_cp(const POINTARRAY *pa, uint32_t n)
Returns a POINT2D pointer into the POINTARRAY serialized_ptlist, suitable for reading from.
Definition: lwinline.h:101
int lw_dist2d_ptarray_ptarray(POINTARRAY *l1, POINTARRAY *l2, DISTPTS *dl)
test each segment of l1 against each segment of l2.
Definition: measures.c:1209
#define DIST_MIN
Definition: measures.h:44
POINT2D p1
Definition: measures.h:52
POINT2D p2
Definition: measures.h:53
double tolerance
Definition: measures.h:56
int mode
Definition: measures.h:54
double distance
Definition: measures.h:51
POINTARRAY * points
Definition: liblwgeom.h:483
POINTARRAY ** rings
Definition: liblwgeom.h:519
uint32_t nrings
Definition: liblwgeom.h:524
double y
Definition: liblwgeom.h:390
double x
Definition: liblwgeom.h:390

References DIST_MIN, DISTPTS::distance, getPoint2d_cp(), lw_dist2d_ptarray_ptarray(), LW_FALSE, LW_OUTSIDE, LW_TRUE, DISTPTS::mode, LWPOLY::nrings, DISTPTS::p1, DISTPTS::p2, LWLINE::points, ptarray_contains_point(), LWPOLY::rings, DISTPTS::tolerance, POINT2D::x, and POINT2D::y.

Referenced by lw_dist2d_distribute_bruteforce().

Here is the call graph for this function:
Here is the caller graph for this function: