ptarray_segmentize_sphere_edge_recursive()

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  )

static

Definition at line 1629 of file lwgeodetic.c.

References cart2geog(), GEOGRAPHIC_POINT::lat, GEOGRAPHIC_POINT::lon, LW_FALSE, LW_SUCCESS, POINT4D::m, normalize(), ptarray_append_point(), rad2deg, POINT3D::x, POINT4D::x, POINT3D::y, POINT4D::y, POINT3D::z, and POINT4D::z.

Referenced by ptarray_segmentize_sphere().

{
        GEOGRAPHIC_POINT g;
        /* Reached the terminal leaf in recursion. Add */
        /* the left-most point to the pointarray here */
        /* We recurse down the left side first, so outputs should */
        /* end up added to the array in order this way */
        if (d <= max_seg_length)
        {
                POINT4D p;
                cart2geog(p1, &g);
                p.x = v1->x;
                p.y = v1->y;
                p.z = v1->z;
                p.m = v1->m;
                return ptarray_append_point(pa, &p, LW_FALSE);
        }
        /* Find the mid-point and recurse on the left and then the right */
        else
        {
                /* Calculate mid-point */
                POINT3D mid;
                mid.x = (p1->x + p2->x) / 2.0;
                mid.y = (p1->y + p2->y) / 2.0;
                mid.z = (p1->z + p2->z) / 2.0;
                normalize(&mid);

                /* Calculate z/m mid-values */
                POINT4D midv;
                cart2geog(&mid, &g);
                midv.x = rad2deg(g.lon);
                midv.y = rad2deg(g.lat);
                midv.z = (v1->z + v2->z) / 2.0;
                midv.m = (v1->m + v2->m) / 2.0;
                /* Recurse on the left first */
                ptarray_segmentize_sphere_edge_recursive(p1, &mid, v1, &midv, d/2.0, max_seg_length, pa);
                ptarray_segmentize_sphere_edge_recursive(&mid, p2, &midv, v2, d/2.0, max_seg_length, pa);
                return LW_SUCCESS;
        }
}

Here is the call graph for this function:

Here is the caller graph for this function: