lw_dist2d_recursive()

int lw_dist2d_recursive	(	const LWGEOM *	lwg1,
		const LWGEOM *	lwg2,
		DISTPTS *	dl
	)

This is a recursive function delivering every possible combinatin of subgeometries.

Definition at line 277 of file measures.c.

References LWGEOM::bbox, DIST_MAX, DIST_MIN, DISTPTS::distance, LWCOLLECTION::geoms, LINETYPE, lw_dist2d_check_overlap(), lw_dist2d_distribute_bruteforce(), lw_dist2d_distribute_fast(), lw_dist2d_is_collection(), lw_dist2d_recursive(), LW_FALSE, LW_TRUE, LWDEBUG, LWDEBUGF, lwgeom_add_bbox(), lwgeom_as_lwcollection(), lwgeom_is_empty(), DISTPTS::mode, LWCOLLECTION::ngeoms, POLYGONTYPE, DISTPTS::tolerance, and LWGEOM::type.

Referenced by lw_dist2d_comp(), lw_dist2d_curvepoly_curvepoly(), lw_dist2d_line_curvepoly(), lw_dist2d_point_curvepoly(), and lw_dist2d_recursive().

{
        int i, j;
        int n1=1;
        int n2=1;
        LWGEOM *g1 = NULL;
        LWGEOM *g2 = NULL;
        LWCOLLECTION *c1 = NULL;
        LWCOLLECTION *c2 = NULL;

        LWDEBUGF(2, "lw_dist2d_comp is called with type1=%d, type2=%d", lwg1->type, lwg2->type);

        if (lw_dist2d_is_collection(lwg1))
        {
                LWDEBUG(3, "First geometry is collection");
                c1 = lwgeom_as_lwcollection(lwg1);
                n1 = c1->ngeoms;
        }
        if (lw_dist2d_is_collection(lwg2))
        {
                LWDEBUG(3, "Second geometry is collection");
                c2 = lwgeom_as_lwcollection(lwg2);
                n2 = c2->ngeoms;
        }

        for ( i = 0; i < n1; i++ )
        {

                if (lw_dist2d_is_collection(lwg1))
                {
                        g1 = c1->geoms[i];
                }
                else
                {
                        g1 = (LWGEOM*)lwg1;
                }

                if (lwgeom_is_empty(g1)) return LW_TRUE;

                if (lw_dist2d_is_collection(g1))
                {
                        LWDEBUG(3, "Found collection inside first geometry collection, recursing");
                        if (!lw_dist2d_recursive(g1, lwg2, dl)) return LW_FALSE;
                        continue;
                }
                for ( j = 0; j < n2; j++ )
                {
                        if (lw_dist2d_is_collection(lwg2))
                        {
                                g2 = c2->geoms[j];
                        }
                        else
                        {
                                g2 = (LWGEOM*)lwg2;
                        }
                        if (lw_dist2d_is_collection(g2))
                        {
                                LWDEBUG(3, "Found collection inside second geometry collection, recursing");
                                if (!lw_dist2d_recursive(g1, g2, dl)) return LW_FALSE;
                                continue;
                        }

                        if ( ! g1->bbox )
                        {
                                lwgeom_add_bbox(g1);
                        }
                        if ( ! g2->bbox )
                        {
                                lwgeom_add_bbox(g2);
                        }

                        /*If one of geometries is empty, return. True here only means continue searching. False would have stoped the process*/
                        if (lwgeom_is_empty(g1)||lwgeom_is_empty(g2)) return LW_TRUE;

                        if ( (dl->mode != DIST_MAX) &&
                                 (! lw_dist2d_check_overlap(g1, g2)) &&
                             (g1->type == LINETYPE || g1->type == POLYGONTYPE) &&
                             (g2->type == LINETYPE || g2->type == POLYGONTYPE) )
                        {
                                if (!lw_dist2d_distribute_fast(g1, g2, dl)) return LW_FALSE;
                        }
                        else
                        {
                                if (!lw_dist2d_distribute_bruteforce(g1, g2, dl)) return LW_FALSE;
                                if (dl->distance<=dl->tolerance && dl->mode == DIST_MIN) return LW_TRUE; /*just a check if  the answer is already given*/
                        }
                }
        }
        return LW_TRUE;
}

Here is the call graph for this function:

Here is the caller graph for this function: