test_rect_tree_contains_point()

static void test_rect_tree_contains_point ( void  )

static

Definition at line 242 of file cu_measures.c.

References boundary(), LW_PARSER_CHECK_NONE, lwgeom_from_wkt(), lwpoly_free(), rect_tree_contains_point(), rect_tree_free(), rect_tree_new(), LWPOLY::rings, POINT2D::x, and POINT2D::y.

Referenced by measures_suite_setup().

{
        LWPOLY *poly;
        POINT2D p;
        RECT_NODE* tree;
        int result;
        int boundary = 0;

        /* square */
        poly = (LWPOLY*)lwgeom_from_wkt("POLYGON((0 0, 0 1, 1 1, 1 0, 0 0))", LW_PARSER_CHECK_NONE);
        tree = rect_tree_new(poly->rings[0]);

        /* inside square */
        boundary = 0;
        p.x = 0.5;
        p.y = 0.5;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_NOT_EQUAL(result, 0);

        /* outside square */
        boundary = 0;
        p.x = 1.5;
        p.y = 0.5;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(result, 0);

        rect_tree_free(tree);
        lwpoly_free(poly);

        /* ziggy zaggy horizontal saw tooth polygon */
        poly = (LWPOLY*)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_new(poly->rings[0]);

        /* not in, left side */
        boundary = 0;
        p.x = -0.5;
        p.y = 0.5;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(result, 0);

        /* not in, right side */
        boundary = 0;
        p.x = 3.0;
        p.y = 1.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(result, 0);

        /* inside */
        boundary = 0;
        p.x = 2.0;
        p.y = 1.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_NOT_EQUAL(result, 0);

        /* on left border */
        boundary = 0;
        p.x = 0.0;
        p.y = 1.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        /* on right border */
        boundary = 0;
        p.x = 4.0;
        p.y = 0.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        /* on tooth concave */
        boundary = 0;
        p.x = 3.0;
        p.y = 3.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        /* on tooth convex */
        boundary = 0;
        p.x = 2.0;
        p.y = 0.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        rect_tree_free(tree);
        lwpoly_free(poly);

        /* ziggy zaggy vertical saw tooth polygon */
        poly = (LWPOLY*)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_new(poly->rings[0]);

        /* not in, left side */
        boundary = 0;
        p.x = -0.5;
        p.y = 3.5;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(result, 0);

        /* not in, right side */
        boundary = 0;
        p.x = 6.0;
        p.y = 2.2;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(result, 0);

        /* inside */
        boundary = 0;
        p.x = 3.0;
        p.y = 2.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_NOT_EQUAL(result, 0);

        /* on bottom border */
        boundary = 0;
        p.x = 1.0;
        p.y = 0.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        /* on top border */
        boundary = 0;
        p.x = 3.0;
        p.y = 6.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        /* on tooth concave */
        boundary = 0;
        p.x = 3.0;
        p.y = 1.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        /* on tooth convex */
        boundary = 0;
        p.x = 0.0;
        p.y = 2.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        /* on tooth convex */
        boundary = 0;
        p.x = 0.0;
        p.y = 6.0;
        result = rect_tree_contains_point(tree, &p, &boundary);
        CU_ASSERT_EQUAL(boundary, 1);

        rect_tree_free(tree);
        lwpoly_free(poly);

}

Here is the call graph for this function:

Here is the caller graph for this function: