PostGIS  2.5.7dev-r@@SVN_REVISION@@

◆ ptarray_contains_point_sphere()

int ptarray_contains_point_sphere ( const POINTARRAY pa,
const POINT2D pt_outside,
const POINT2D pt_to_test 
)

This routine returns LW_TRUE if the stabline joining the pt_outside and pt_to_test crosses the ring an odd number of times, or if the pt_to_test is on the ring boundary itself, returning LW_FALSE otherwise.

The pt_outside must be guaranteed to be outside the ring (use the geography_pt_outside() function to derive one in postgis, or the gbox_pt_outside() function if you don't mind burning CPU cycles building a gbox first).

Definition at line 3645 of file lwgeodetic.c.

3646 {
3647  POINT3D S1, S2; /* Stab line end points */
3648  POINT3D E1, E2; /* Edge end points (3-space) */
3649  POINT2D p; /* Edge end points (lon/lat) */
3650  uint32_t count = 0, i, inter;
3651 
3652  /* Null input, not enough points for a ring? You ain't closed! */
3653  if ( ! pa || pa->npoints < 4 )
3654  return LW_FALSE;
3655 
3656  /* Set up our stab line */
3657  ll2cart(pt_to_test, &S1);
3658  ll2cart(pt_outside, &S2);
3659 
3660  /* Initialize first point */
3661  getPoint2d_p(pa, 0, &p);
3662  ll2cart(&p, &E1);
3663 
3664  /* Walk every edge and see if the stab line hits it */
3665  for ( i = 1; i < pa->npoints; i++ )
3666  {
3667  LWDEBUGF(4, "testing edge (%d)", i);
3668  LWDEBUGF(4, " start point == POINT(%.12g %.12g)", p.x, p.y);
3669 
3670  /* Read next point. */
3671  getPoint2d_p(pa, i, &p);
3672  ll2cart(&p, &E2);
3673 
3674  /* Skip over too-short edges. */
3675  if ( point3d_equals(&E1, &E2) )
3676  {
3677  continue;
3678  }
3679 
3680  /* Our test point is on an edge end! Point is "in ring" by our definition */
3681  if ( point3d_equals(&S1, &E1) )
3682  {
3683  return LW_TRUE;
3684  }
3685 
3686  /* Calculate relationship between stab line and edge */
3687  inter = edge_intersects(&S1, &S2, &E1, &E2);
3688 
3689  /* We have some kind of interaction... */
3690  if ( inter & PIR_INTERSECTS )
3691  {
3692  /* If the stabline is touching the edge, that implies the test point */
3693  /* is on the edge, so we're done, the point is in (on) the ring. */
3694  if ( (inter & PIR_A_TOUCH_RIGHT) || (inter & PIR_A_TOUCH_LEFT) )
3695  {
3696  return LW_TRUE;
3697  }
3698 
3699  /* It's a touching interaction, disregard all the left-side ones. */
3700  /* It's a co-linear intersection, ignore those. */
3701  if ( inter & PIR_B_TOUCH_RIGHT || inter & PIR_COLINEAR )
3702  {
3703  /* Do nothing, to avoid double counts. */
3704  LWDEBUGF(4," edge (%d) crossed, disregarding to avoid double count", i, count);
3705  }
3706  else
3707  {
3708  /* Increment crossingn count. */
3709  count++;
3710  LWDEBUGF(4," edge (%d) crossed, count == %d", i, count);
3711  }
3712  }
3713  else
3714  {
3715  LWDEBUGF(4," edge (%d) did not cross", i);
3716  }
3717 
3718  /* Increment to next edge */
3719  E1 = E2;
3720  }
3721 
3722  LWDEBUGF(4,"final count == %d", count);
3723 
3724  /* An odd number of crossings implies containment! */
3725  if ( count % 2 )
3726  {
3727  return LW_TRUE;
3728  }
3729 
3730  return LW_FALSE;
3731 }
#define LW_FALSE
Definition: liblwgeom.h:77
int getPoint2d_p(const POINTARRAY *pa, uint32_t n, POINT2D *point)
Definition: lwgeom_api.c:348
#define LW_TRUE
Return types for functions with status returns.
Definition: liblwgeom.h:76
void ll2cart(const POINT2D *g, POINT3D *p)
Convert lon/lat coordinates to cartesian coordinates on unit sphere.
Definition: lwgeodetic.c:423
uint32_t edge_intersects(const POINT3D *A1, const POINT3D *A2, const POINT3D *B1, const POINT3D *B2)
Returns non-zero if edges A and B interact.
Definition: lwgeodetic.c:3540
static int point3d_equals(const POINT3D *p1, const POINT3D *p2)
Utility function for ptarray_contains_point_sphere()
Definition: lwgeodetic.c:42
#define PIR_A_TOUCH_LEFT
Definition: lwgeodetic.h:90
#define PIR_COLINEAR
Definition: lwgeodetic.h:88
#define PIR_INTERSECTS
Definition: lwgeodetic.h:87
#define PIR_A_TOUCH_RIGHT
Definition: lwgeodetic.h:89
#define PIR_B_TOUCH_RIGHT
Definition: lwgeodetic.h:91
#define LWDEBUGF(level, msg,...)
Definition: lwgeom_log.h:88
int count
Definition: genraster.py:56
double y
Definition: liblwgeom.h:331
double x
Definition: liblwgeom.h:331
uint32_t npoints
Definition: liblwgeom.h:374
unsigned int uint32_t
Definition: uthash.h:78

References genraster::count, edge_intersects(), getPoint2d_p(), ll2cart(), LW_FALSE, LW_TRUE, LWDEBUGF, POINTARRAY::npoints, PIR_A_TOUCH_LEFT, PIR_A_TOUCH_RIGHT, PIR_B_TOUCH_RIGHT, PIR_COLINEAR, PIR_INTERSECTS, point3d_equals(), POINT2D::x, and POINT2D::y.

Referenced by lwpoly_covers_point2d(), test_ptarray_contains_point_sphere(), and test_ptarray_contains_point_sphere_iowa().

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