PostGIS  3.4.0dev-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 3646 of file lwgeodetic.c.

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

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: