test_rect_tree_contains_point()

static void test_rect_tree_contains_point ( void  )

static

Definition at line 351 of file cu_measures.c.

{
        LWGEOM *poly;
        RECT_NODE* tree;
 
        /**********************************************************************
        * curvepolygon
        */
        poly = lwgeom_from_wkt("CURVEPOLYGON(COMPOUNDCURVE(CIRCULARSTRING(0 0,1 5,0 10),(0 10,10 10,10 0, 0 0)),COMPOUNDCURVE(CIRCULARSTRING(3 7,5 8,7 7),(7 7,7 3,3 3, 3 7)))", LW_PARSER_CHECK_NONE);
        tree = rect_tree_from_lwgeom(poly);
        // char *wkt = rect_tree_to_wkt(tree);
        // printf("%s\n", wkt);
        // lwfree(wkt);
        // return;
 
        /* in hole, within arc stroke */
        CU_ASSERT_EQUAL(tree_pt(tree, 5, 7.5), 0);
        /* inside */
        CU_ASSERT_EQUAL(tree_pt(tree, 8, 9), 1);
        /* outside */
        CU_ASSERT_EQUAL(tree_pt(tree, -1, 5), 0);
        /* outside */
        CU_ASSERT_EQUAL(tree_pt(tree, -1, 7.5), 0);
        /* outside, within arc stroke */
        CU_ASSERT_EQUAL(tree_pt(tree, 0.2, 7.5), 0);
        /* inside, within arc stroke */
        CU_ASSERT_EQUAL(tree_pt(tree, 0.5, 0.5), 1);
        /* inside, crossing arc stroke */
        CU_ASSERT_EQUAL(tree_pt(tree, 2, 7.5), 1);
        /* touching hole corner */
        CU_ASSERT_EQUAL(tree_pt(tree, 7, 7), 1);
 
        rect_tree_free(tree);
        lwgeom_free(poly);
 
 
        /**********************************************************************
        * polygon with hole and concavities
        */
        poly = lwgeom_from_wkt("POLYGON((0 0,0 10,10 10,10 0,9 0,9 9,8 6,8 0,2 0,2 9,1 6,1 0,0 0),(4 4,4 6,6 6,6 4,4 4))", LW_PARSER_CHECK_NONE);
        tree = rect_tree_from_lwgeom(poly);
 
        /* inside, many grazings */
        CU_ASSERT_EQUAL(tree_pt(tree, 3, 6), 1);
        /* inside */
        CU_ASSERT_EQUAL(tree_pt(tree, 3, 5.5), 1);
        /* outside */
        CU_ASSERT_EQUAL(tree_pt(tree, -3, 5.5), 0);
        /* touching interior ring */
        CU_ASSERT_EQUAL(tree_pt(tree, 4, 4), 1);
        CU_ASSERT_EQUAL(tree_pt(tree, 6, 6), 1);
        /* touching interior ring */
        CU_ASSERT_EQUAL(tree_pt(tree, 4.5, 4), 1);
        /* touching exterior ring */
        CU_ASSERT_EQUAL(tree_pt(tree, 8, 0), 1);
        CU_ASSERT_EQUAL(tree_pt(tree, 9, 0), 1);
        CU_ASSERT_EQUAL(tree_pt(tree, 10, 1), 1);
        CU_ASSERT_EQUAL(tree_pt(tree, 9.5, 1), 1);
        CU_ASSERT_EQUAL(tree_pt(tree, 0, 10), 1);
        /* touching grazing spike */
        CU_ASSERT_EQUAL(tree_pt(tree, 1, 6), 1);
        /* outide, many grazings */
        CU_ASSERT_EQUAL(tree_pt(tree, -1, 6), 0);
        /* within hole */
        CU_ASSERT_EQUAL(tree_pt(tree, 5, 5), 0);
        /* within */
        CU_ASSERT_EQUAL(tree_pt(tree, 0.5, 4), 1);
        CU_ASSERT_EQUAL(tree_pt(tree, 0.5, 6), 1);
        CU_ASSERT_EQUAL(tree_pt(tree, 0.5, 9), 1);
 
        rect_tree_free(tree);
        lwgeom_free(poly);
 
        /**********************************************************************
        * square
        */
        poly = lwgeom_from_wkt("POLYGON((0 0, 0 1, 1 1, 1 0, 0 0))", LW_PARSER_CHECK_NONE);
        tree = rect_tree_from_lwgeom(poly);
 
        /* inside square */
        CU_ASSERT_EQUAL(tree_pt(tree, 0.5, 0.5), 1);
        /* outside square */
        CU_ASSERT_EQUAL(tree_pt(tree, 1.5, 0.5), 0);
        /* outside square grazing some edges */
        CU_ASSERT_EQUAL(tree_pt(tree, -1, 1), 0);
        /* inside square on corner */
        CU_ASSERT_EQUAL(tree_pt(tree, 1, 1), 1);
        /* inside square on top edge */
        CU_ASSERT_EQUAL(tree_pt(tree, 0.5, 1), 1);
        /* inside square on side edge */
        CU_ASSERT_EQUAL(tree_pt(tree, 1, 0.5), 1);
 
        rect_tree_free(tree);
        lwgeom_free(poly);
 
        /* ziggy zaggy horizontal saw tooth polygon */
        poly = lwgeom_from_wkt("POLYGON((0 0, 1 3, 2 0, 3 3, 4 0, 4 5, 0 5, 0 0))", LW_PARSER_CHECK_NONE);
        tree = rect_tree_from_lwgeom(poly);
 
        /* not in, left side */
        CU_ASSERT_EQUAL(tree_pt(tree, -0.5, 0.5), 0);
        /* not in, right side */
        CU_ASSERT_EQUAL(tree_pt(tree, 3, 1), 0);
        /* inside */
        CU_ASSERT_EQUAL(tree_pt(tree, 2, 1), 1);
        /* on left border */
        CU_ASSERT_EQUAL(tree_pt(tree, 0, 1), 1);
        /* on left border, grazing */
        CU_ASSERT_EQUAL(tree_pt(tree, 0, 3), 1);
        /* on right border */
        CU_ASSERT_EQUAL(tree_pt(tree, 4, 0), 1);
        /* on tooth concave */
        CU_ASSERT_EQUAL(tree_pt(tree, 3, 3), 1);
        /* on tooth convex */
        CU_ASSERT_EQUAL(tree_pt(tree, 2, 0), 1);
 
        rect_tree_free(tree);
        lwgeom_free(poly);
 
        /**********************************************************************
        * ziggy zaggy vertical saw tooth polygon
        */
        poly = lwgeom_from_wkt("POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))", LW_PARSER_CHECK_NONE);
        tree = rect_tree_from_lwgeom(poly);
 
        /* not in, left side */
        CU_ASSERT_EQUAL(tree_pt(tree, -0.5, 3.5), 0);
        /* not in, right side */
        CU_ASSERT_EQUAL(tree_pt(tree, 6.0, 2.2), 0);
        /* inside */
        CU_ASSERT_EQUAL(tree_pt(tree, 3, 2), 1);
        /* on bottom border */
        CU_ASSERT_EQUAL(tree_pt(tree, 1, 0), 1);
        /* on top border */
        CU_ASSERT_EQUAL(tree_pt(tree, 3, 6), 1);
        /* on tooth concave */
        CU_ASSERT_EQUAL(tree_pt(tree, 3, 1), 1);
        /* on tooth convex */
        CU_ASSERT_EQUAL(tree_pt(tree, 0, 2), 1);
        /* on tooth convex */
        CU_ASSERT_EQUAL(tree_pt(tree, 0, 6), 1);
 
        rect_tree_free(tree);
        lwgeom_free(poly);
 
}

References LW_PARSER_CHECK_NONE, lwgeom_free(), lwgeom_from_wkt(), rect_tree_free(), rect_tree_from_lwgeom(), and tree_pt().

Referenced by measures_suite_setup().

Here is the call graph for this function:

Here is the caller graph for this function: