PostGIS  3.2.2dev-r@@SVN_REVISION@@

◆ ptarray_segmentize_sphere()

static POINTARRAY* ptarray_segmentize_sphere ( const POINTARRAY pa_in,
double  max_seg_length 
)
static

Create a new point array with no segment longer than the input segment length (expressed in radians!)

Parameters
pa_in- input point array pointer
max_seg_length- maximum output segment length in radians

Definition at line 1686 of file lwgeodetic.c.

1687 {
1688  POINTARRAY *pa_out;
1689  int hasz = ptarray_has_z(pa_in);
1690  int hasm = ptarray_has_m(pa_in);
1691  POINT4D p1, p2;
1692  POINT3D q1, q2;
1693  GEOGRAPHIC_POINT g1, g2;
1694  uint32_t i;
1695 
1696  /* Just crap out on crazy input */
1697  if ( ! pa_in )
1698  lwerror("%s: null input pointarray", __func__);
1699  if ( max_seg_length <= 0.0 )
1700  lwerror("%s: maximum segment length must be positive", __func__);
1701 
1702  /* Empty starting array */
1703  pa_out = ptarray_construct_empty(hasz, hasm, pa_in->npoints);
1704 
1705  /* Simple loop per edge */
1706  for (i = 1; i < pa_in->npoints; i++)
1707  {
1708  getPoint4d_p(pa_in, i-1, &p1);
1709  getPoint4d_p(pa_in, i, &p2);
1710  geographic_point_init(p1.x, p1.y, &g1);
1711  geographic_point_init(p2.x, p2.y, &g2);
1712 
1713  /* Skip duplicate points (except in case of 2-point lines!) */
1714  if ((pa_in->npoints > 2) && p4d_same(&p1, &p2))
1715  continue;
1716 
1717  /* How long is this edge? */
1718  double d = sphere_distance(&g1, &g2);
1719 
1720  if (d > max_seg_length)
1721  {
1722  geog2cart(&g1, &q1);
1723  geog2cart(&g2, &q2);
1724  /* 3-d end points, XYZM end point, current edge size, min edge size */
1725  ptarray_segmentize_sphere_edge_recursive(&q1, &q2, &p1, &p2, d, max_seg_length, pa_out);
1726  }
1727  /* If we don't segmentize, we need to add first point manually */
1728  else
1729  {
1730  ptarray_append_point(pa_out, &p1, LW_TRUE);
1731  }
1732  }
1733  /* Always add the last point */
1734  ptarray_append_point(pa_out, &p2, LW_TRUE);
1735  return pa_out;
1736 }
POINTARRAY * ptarray_construct_empty(char hasz, char hasm, uint32_t maxpoints)
Create a new POINTARRAY with no points.
Definition: ptarray.c:59
int getPoint4d_p(const POINTARRAY *pa, uint32_t n, POINT4D *point)
Definition: lwgeom_api.c:126
int ptarray_append_point(POINTARRAY *pa, const POINT4D *pt, int allow_duplicates)
Append a point to the end of an existing POINTARRAY If allow_duplicate is LW_FALSE,...
Definition: ptarray.c:147
#define LW_TRUE
Return types for functions with status returns.
Definition: liblwgeom.h:107
int p4d_same(const POINT4D *p1, const POINT4D *p2)
Definition: lwalgorithm.c:32
int ptarray_has_z(const POINTARRAY *pa)
Definition: ptarray.c:37
int ptarray_has_m(const POINTARRAY *pa)
Definition: ptarray.c:44
void geographic_point_init(double lon, double lat, GEOGRAPHIC_POINT *g)
Initialize a geographic point.
Definition: lwgeodetic.c:180
static int ptarray_segmentize_sphere_edge_recursive(const POINT3D *p1, const POINT3D *p2, const POINT4D *v1, const POINT4D *v2, double d, double max_seg_length, POINTARRAY *pa)
Definition: lwgeodetic.c:1635
double sphere_distance(const GEOGRAPHIC_POINT *s, const GEOGRAPHIC_POINT *e)
Given two points on a unit sphere, calculate their distance apart in radians.
Definition: lwgeodetic.c:948
void geog2cart(const GEOGRAPHIC_POINT *g, POINT3D *p)
Convert spherical coordinates to cartesian coordinates on unit sphere.
Definition: lwgeodetic.c:404
void lwerror(const char *fmt,...)
Write a notice out to the error handler.
Definition: lwutil.c:190
Point in spherical coordinates on the world.
Definition: lwgeodetic.h:54
double x
Definition: liblwgeom.h:428
double y
Definition: liblwgeom.h:428
uint32_t npoints
Definition: liblwgeom.h:441

References geog2cart(), geographic_point_init(), getPoint4d_p(), LW_TRUE, lwerror(), POINTARRAY::npoints, p4d_same(), ptarray_append_point(), ptarray_construct_empty(), ptarray_has_m(), ptarray_has_z(), ptarray_segmentize_sphere_edge_recursive(), sphere_distance(), POINT4D::x, and POINT4D::y.

Referenced by lwgeom_segmentize_sphere().

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