test_lwpoly_construct_circle()

static void test_lwpoly_construct_circle ( void  )

static

Definition at line 1122 of file cu_algorithm.c.

References ASSERT_INT_EQUAL, LW_TRUE, lwgeom_area(), lwgeom_count_vertices(), lwgeom_get_bbox(), lwgeom_get_srid(), lwpoly_as_lwgeom(), lwpoly_construct_circle(), lwpoly_free(), r, pixval::x, GBOX::xmax, GBOX::xmin, pixval::y, GBOX::ymax, and GBOX::ymin.

Referenced by algorithms_suite_setup().

{
        LWPOLY* p;
        const GBOX* g;
        const int srid = 4326;
        const int segments_per_quad = 17;
        const int x = 10;
        const int y = 20;
        const int r = 5;

        /* With normal arguments you should get something circle-y */
        p = lwpoly_construct_circle(srid, x, y, r, segments_per_quad, LW_TRUE);

        ASSERT_INT_EQUAL(lwgeom_count_vertices(lwpoly_as_lwgeom(p)), segments_per_quad * 4 + 1);
        ASSERT_INT_EQUAL(lwgeom_get_srid(lwpoly_as_lwgeom(p)), srid)

        g = lwgeom_get_bbox(lwpoly_as_lwgeom(p));
        CU_ASSERT_DOUBLE_EQUAL(g->xmin, x-r, 0.1);
        CU_ASSERT_DOUBLE_EQUAL(g->xmax, x+r, 0.1);
        CU_ASSERT_DOUBLE_EQUAL(g->ymin, y-r, 0.1);
        CU_ASSERT_DOUBLE_EQUAL(g->ymax, y+r, 0.1);

        CU_ASSERT_DOUBLE_EQUAL(lwgeom_area(lwpoly_as_lwgeom(p)), M_PI*5*5, 0.1);

        lwpoly_free(p);

        /* No segments? No circle. */
        p = lwpoly_construct_circle(srid, x, y, r, 0, LW_TRUE);
        CU_ASSERT_TRUE(p == NULL);

        /* Negative radius? No circle. */
        p = lwpoly_construct_circle(srid, x, y, -1e-3, segments_per_quad, LW_TRUE);
        CU_ASSERT_TRUE(p == NULL);

        /* Zero radius? Invalid circle */
        p = lwpoly_construct_circle(srid, x, y, 0, segments_per_quad, LW_TRUE);
        CU_ASSERT_TRUE(p != NULL);
        lwpoly_free(p);
}

Here is the call graph for this function:

Here is the caller graph for this function: