PostGIS  2.4.9dev-r@@SVN_REVISION@@

◆ lwgeom_covers_lwgeom_sphere()

int lwgeom_covers_lwgeom_sphere ( const LWGEOM lwgeom1,
const LWGEOM lwgeom2 
)

Calculate covers predicate for two lwgeoms on the sphere.

Currently only handles point-in-polygon.

Definition at line 2405 of file lwgeodetic.c.

References LWGEOM::bbox, GBOX::flags, LWCOLLECTION::geoms, getPoint2d_p(), LINETYPE, LW_FALSE, LW_TRUE, LWDEBUG, lwerror(), lwgeom_calculate_gbox_geodetic(), lwline_covers_lwline(), lwline_covers_lwpoint(), lwpoint_same(), lwpoly_covers_lwline(), lwpoly_covers_lwpoly(), lwpoly_covers_point2d(), lwtype_is_collection(), LWCOLLECTION::ngeoms, POINTTYPE, POLYGONTYPE, and LWGEOM::type.

Referenced by geography_covers().

2406 {
2407  int type1, type2;
2408  GBOX gbox1, gbox2;
2409  gbox1.flags = gbox2.flags = 0;
2410 
2411  assert(lwgeom1);
2412  assert(lwgeom2);
2413 
2414  type1 = lwgeom1->type;
2415  type2 = lwgeom2->type;
2416 
2417  /* dim(geom2) > dim(geom1) always returns false (because geom2 is bigger) */
2418  if ( (type1 == POINTTYPE && type2 == LINETYPE)
2419  || (type1 == POINTTYPE && type2 == POLYGONTYPE)
2420  || (type1 == LINETYPE && type2 == POLYGONTYPE) )
2421  {
2422  LWDEBUG(4, "dimension of geom2 is bigger than geom1");
2423  return LW_FALSE;
2424  }
2425 
2426  /* Make sure we have boxes */
2427  if ( lwgeom1->bbox )
2428  gbox1 = *(lwgeom1->bbox);
2429  else
2430  lwgeom_calculate_gbox_geodetic(lwgeom1, &gbox1);
2431 
2432  /* Make sure we have boxes */
2433  if ( lwgeom2->bbox )
2434  gbox2 = *(lwgeom2->bbox);
2435  else
2436  lwgeom_calculate_gbox_geodetic(lwgeom2, &gbox2);
2437 
2438 
2439  /* Handle the polygon/point case */
2440  if ( type1 == POLYGONTYPE && type2 == POINTTYPE )
2441  {
2442  POINT2D pt_to_test;
2443  getPoint2d_p(((LWPOINT*)lwgeom2)->point, 0, &pt_to_test);
2444  return lwpoly_covers_point2d((LWPOLY*)lwgeom1, &pt_to_test);
2445  }
2446  else if ( type1 == POLYGONTYPE && type2 == LINETYPE)
2447  {
2448  return lwpoly_covers_lwline((LWPOLY*)lwgeom1, (LWLINE*)lwgeom2);
2449  }
2450  else if ( type1 == POLYGONTYPE && type2 == POLYGONTYPE)
2451  {
2452  return lwpoly_covers_lwpoly((LWPOLY*)lwgeom1, (LWPOLY*)lwgeom2);
2453  }
2454  else if ( type1 == LINETYPE && type2 == POINTTYPE)
2455  {
2456  return lwline_covers_lwpoint((LWLINE*)lwgeom1, (LWPOINT*)lwgeom2);
2457  }
2458  else if ( type1 == LINETYPE && type2 == LINETYPE)
2459  {
2460  return lwline_covers_lwline((LWLINE*)lwgeom1, (LWLINE*)lwgeom2);
2461  }
2462  else if ( type1 == POINTTYPE && type2 == POINTTYPE)
2463  {
2464  return lwpoint_same((LWPOINT*)lwgeom1, (LWPOINT*)lwgeom2);
2465  }
2466 
2467  /* If any of the first argument parts covers the second argument, it's true */
2468  if ( lwtype_is_collection( type1 ) )
2469  {
2470  int i;
2471  LWCOLLECTION *col = (LWCOLLECTION*)lwgeom1;
2472 
2473  for ( i = 0; i < col->ngeoms; i++ )
2474  {
2475  if ( lwgeom_covers_lwgeom_sphere(col->geoms[i], lwgeom2) )
2476  {
2477  return LW_TRUE;
2478  }
2479  }
2480  return LW_FALSE;
2481  }
2482 
2483  /* Only if all of the second arguments are covered by the first argument is the condition true */
2484  if ( lwtype_is_collection( type2 ) )
2485  {
2486  int i;
2487  LWCOLLECTION *col = (LWCOLLECTION*)lwgeom2;
2488 
2489  for ( i = 0; i < col->ngeoms; i++ )
2490  {
2491  if ( ! lwgeom_covers_lwgeom_sphere(lwgeom1, col->geoms[i]) )
2492  {
2493  return LW_FALSE;
2494  }
2495  }
2496  return LW_TRUE;
2497  }
2498 
2499  /* Don't get here */
2500  lwerror("lwgeom_covers_lwgeom_sphere: reached end of function without resolution");
2501  return LW_FALSE;
2502 
2503 }
#define LINETYPE
Definition: liblwgeom.h:86
GBOX * bbox
Definition: liblwgeom.h:398
char lwpoint_same(const LWPOINT *p1, const LWPOINT *p2)
Definition: lwpoint.c:264
int lwpoly_covers_lwpoly(const LWPOLY *poly1, const LWPOLY *poly2)
Given a polygon1 check if all points of polygon2 are inside polygon1 and no intersections of the poly...
Definition: lwgeodetic.c:2585
int lwgeom_covers_lwgeom_sphere(const LWGEOM *lwgeom1, const LWGEOM *lwgeom2)
Calculate covers predicate for two lwgeoms on the sphere.
Definition: lwgeodetic.c:2405
#define POLYGONTYPE
Definition: liblwgeom.h:87
#define LWDEBUG(level, msg)
Definition: lwgeom_log.h:83
#define LW_FALSE
Definition: liblwgeom.h:77
#define LW_TRUE
Return types for functions with status returns.
Definition: liblwgeom.h:76
LWGEOM ** geoms
Definition: liblwgeom.h:509
int lwgeom_calculate_gbox_geodetic(const LWGEOM *geom, GBOX *gbox)
Calculate the geodetic bounding box for an LWGEOM.
Definition: lwgeodetic.c:3012
int lwpoly_covers_lwline(const LWPOLY *poly, const LWLINE *line)
Definition: lwgeodetic.c:2643
int lwtype_is_collection(uint8_t type)
Determine whether a type number is a collection or not.
Definition: lwgeom.c:1048
int lwline_covers_lwline(const LWLINE *lwline1, const LWLINE *lwline2)
Check if first and last point of line2 are covered by line1 and then each point in between has to be ...
Definition: lwgeodetic.c:2769
int getPoint2d_p(const POINTARRAY *pa, int n, POINT2D *point)
Definition: lwgeom_api.c:347
uint8_t flags
Definition: liblwgeom.h:291
#define POINTTYPE
LWTYPE numbers, used internally by PostGIS.
Definition: liblwgeom.h:85
uint8_t type
Definition: liblwgeom.h:396
int lwpoly_covers_point2d(const LWPOLY *poly, const POINT2D *pt_to_test)
Given a polygon (lon/lat decimal degrees) and point (lon/lat decimal degrees) and a guaranteed outsid...
Definition: lwgeodetic.c:2510
int lwline_covers_lwpoint(const LWLINE *lwline, const LWPOINT *lwpoint)
return LW_TRUE if any of the line segments covers the point
Definition: lwgeodetic.c:2740
void lwerror(const char *fmt,...)
Write a notice out to the error handler.
Definition: lwutil.c:190
Here is the call graph for this function:
Here is the caller graph for this function: