test_tree_circ_pip()

static void test_tree_circ_pip ( void  )

static

Definition at line 47 of file cu_tree.c.

References circ_tree_contains_point(), circ_tree_free(), circ_tree_new(), LW_PARSER_CHECK_NONE, lwgeom_as_lwline(), lwgeom_from_wkt(), lwline_free(), LWLINE::points, POINT2D::x, and POINT2D::y.

Referenced by tree_suite_setup().

{
        LWLINE *g;
        CIRC_NODE *c;
        POINT2D pt, pt_outside;
        int rv, on_boundary;

        pt.x = 0.0;
        pt.y = 0.0;
        pt_outside.x = -2.0;
        pt_outside.y = 0.0;

        /* Point in square */
        g = lwgeom_as_lwline(lwgeom_from_wkt("LINESTRING(-1 -1,1 -1,1 1,-1 1,-1 -1)", LW_PARSER_CHECK_NONE));
        c = circ_tree_new(g->points);
        rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary);
        CU_ASSERT_EQUAL(rv, 1);

        /* Point on other side of square */
        pt.x = 2.0;
        pt.y = 0.0;
        rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary);
        CU_ASSERT_EQUAL(rv, 0);

        /* Clean and do new shape */
        circ_tree_free(c);
        lwline_free(g);

        /* Point in square, stab passing through vertex */
        pt.x = 0.0;
        pt.y = 0.0;
        g = lwgeom_as_lwline(lwgeom_from_wkt("LINESTRING(-1 -1,0 -1,1 -1,1 0,1 1,0 1,-1 1,-1 0,-1 -1)", LW_PARSER_CHECK_NONE));
        c = circ_tree_new(g->points);
        //circ_tree_print(c, 0);
        rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary);
        CU_ASSERT_EQUAL(rv, 1);

        /* Point on other side of square, stab passing through vertex */
        pt.x = 2.0;
        pt.y = 0.0;
        rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary);
        CU_ASSERT_EQUAL(rv, 0);

        /* Clean and do new shape */
        circ_tree_free(c);
        lwline_free(g);

        /* Point outside "w" thing, stab passing through vertexes and grazing pointy thing */
        pt.x = 2.0;
        pt.y = 0.0;
        g = lwgeom_as_lwline(lwgeom_from_wkt("LINESTRING(-1 -1,0 -1,1 -1,1 0,1 1,0 0,-1 1,-1 0,-1 -1)", LW_PARSER_CHECK_NONE));
        c = circ_tree_new(g->points);
        //circ_tree_print(c, 0);
        rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary);
        //printf("rv %d\n", rv);
        CU_ASSERT_EQUAL(rv, 0);

        /* Point inside "w" thing, stab passing through vertexes and grazing pointy thing */
        pt.x = 0.8;
        pt.y = 0.0;
        rv = circ_tree_contains_point(c, &pt, &pt_outside, 0, &on_boundary);
        //printf("rv %d\n", rv);
        CU_ASSERT_EQUAL(rv, 1);

        /* Clean and do new shape */
        circ_tree_free(c);
        lwline_free(g);

}

Here is the call graph for this function:

Here is the caller graph for this function: