test_lwgeom_simplify()

static void test_lwgeom_simplify ( void  )

static

Definition at line 1267 of file cu_algorithm.c.

{
        LWGEOM *l;
        LWGEOM *g;
        char *ewkt;
 
        /* Simplify but only so far... */
        g = lwgeom_from_wkt("LINESTRING(0 0, 1 0, 1 1, 0 1, 0 0)", LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 10, LW_TRUE);
        ewkt = lwgeom_to_ewkt(l);
        ASSERT_STRING_EQUAL(ewkt, "LINESTRING(0 0,0 0)");
        lwgeom_free(g);
        lwgeom_free(l);
        lwfree(ewkt);
 
        /* Simplify but only so far... */
        g = lwgeom_from_wkt("POLYGON((0 0, 1 0, 1 1, 0 1, 0 0))", LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 10, LW_TRUE);
        ewkt = lwgeom_to_ewkt(l);
        ASSERT_STRING_EQUAL(ewkt, "POLYGON((0 0,1 0,1 1,0 0))");
        lwgeom_free(g);
        lwgeom_free(l);
        lwfree(ewkt);
 
        /* Simplify and collapse */
        g = lwgeom_from_wkt("LINESTRING(0 0, 1 0, 1 1, 0 1, 0 0)", LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 10, LW_FALSE);
        CU_ASSERT_EQUAL(l, NULL);
        lwgeom_free(g);
        lwgeom_free(l);
 
        /* Simplify and collapse */
        g = lwgeom_from_wkt("POLYGON((0 0, 1 0, 1 1, 0 1, 0 0))", LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 10, LW_FALSE);
        CU_ASSERT_EQUAL(l, NULL);
        lwgeom_free(g);
        lwgeom_free(l);
 
        /* Not simplifiable */
        g = lwgeom_from_wkt("LINESTRING(0 0, 50 1.00001, 100 0)", LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 1.0, LW_FALSE);
        ewkt = lwgeom_to_ewkt(l);
        ASSERT_STRING_EQUAL(ewkt, "LINESTRING(0 0,50 1.00001,100 0)");
        lwgeom_free(g);
        lwgeom_free(l);
        lwfree(ewkt);
 
        /* Simplifiable */
        g = lwgeom_from_wkt("LINESTRING(0 0,50 0.99999,100 0)", LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 1.0, LW_FALSE);
        ewkt = lwgeom_to_ewkt(l);
        ASSERT_STRING_EQUAL(ewkt, "LINESTRING(0 0,100 0)");
        lwgeom_free(g);
        lwgeom_free(l);
        lwfree(ewkt);
 
        /* POLYGON with multiple inner rings*/
        g = lwgeom_from_wkt(
            "POLYGON("
            "(0 0, 100 0, 100 100, 0 100, 0 0),"
            "(1 1, 1 5, 5 5, 5 1, 1 1),"
            "(20 20, 20 40, 40 40, 40 20, 20 20)"
            ")",
            LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 10, LW_FALSE);
        ewkt = lwgeom_to_ewkt(l);
        ASSERT_STRING_EQUAL(ewkt, "POLYGON((0 0,100 0,100 100,0 100,0 0),(20 20,20 40,40 40,40 20,20 20))");
        lwgeom_free(g);
        lwgeom_free(l);
        lwfree(ewkt);
 
        /* Reorder inner rings: Same result */
        g = lwgeom_from_wkt(
            "POLYGON("
            "(0 0, 100 0, 100 100, 0 100, 0 0),"
            "(20 20, 20 40, 40 40, 40 20, 20 20),"
            "(1 1, 1 5, 5 5, 5 1, 1 1)"
            ")",
            LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 10, LW_FALSE);
        ewkt = lwgeom_to_ewkt(l);
        ASSERT_STRING_EQUAL(ewkt, "POLYGON((0 0,100 0,100 100,0 100,0 0),(20 20,20 40,40 40,40 20,20 20))");
        lwgeom_free(g);
        lwgeom_free(l);
        lwfree(ewkt);
 
        g = lwgeom_from_wkt(
            "POLYGON("
            "(0 0, 100 0, 100 100, 0 100, 0 0),"
            "(20 20, 20 40, 40 40, 40 20, 20 20),"
            "(1 1, 1 5, 5 5, 5 1, 1 1)"
            ")",
            LW_PARSER_CHECK_NONE);
        l = lwgeom_simplify(g, 100, LW_FALSE);
        CU_ASSERT_EQUAL(l, NULL);
        lwgeom_free(g);
        lwgeom_free(l);
}

References ASSERT_STRING_EQUAL, LW_FALSE, LW_PARSER_CHECK_NONE, LW_TRUE, lwfree(), lwgeom_free(), lwgeom_from_wkt(), lwgeom_simplify(), and lwgeom_to_ewkt().

Referenced by algorithms_suite_setup().

Here is the call graph for this function:

Here is the caller graph for this function: