// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2013 Adam Wulkiewicz, Lodz, Poland. // This file was modified by Oracle on 2013. // Modifications copyright (c) 2013, Oracle and/or its affiliates. // Use, modification and distribution is subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #include #include #include #include template void test_intersects_polygon_polygon() { typedef bg::model::polygon poly_ccw_o; test_geometry("POLYGON((1 1, 3 3, 2 5))", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", true); test_geometry("POLYGON((6 6, 7 6, 7 7, 6 7))", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", false); test_geometry("POLYGON((7 7, 9 7, 9 9, 7 9))", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", true); } template void test_intersects_linestring_segment() { typedef bg::model::linestring

ls; typedef bg::model::segment

seg; test_geometry("LINESTRING(1 1, 3 3, 2 5)", "SEGMENT(2 0, 2 6)", true); test_geometry("LINESTRING(1 1, 3 3)", "SEGMENT(1 0, 1 1)", true); test_geometry("LINESTRING(1 1, 3 3)", "SEGMENT(2 0, 2 2)", true); test_geometry("LINESTRING(1 1, 3 3)", "SEGMENT(3 0, 4 1)", false); } template void test_intersects_linestring_linestring() { typedef bg::model::linestring

ls; test_geometry("LINESTRING(0 0,2 0,3 0)", "LINESTRING(0 0,1 1,2 2)", true); test_geometry("LINESTRING(0 0,2 0,3 0)", "LINESTRING(2 2,1 1,0 0)", true); test_geometry("LINESTRING(3 0,2 0,0 0)", "LINESTRING(0 0,1 1,2 2)", true); test_geometry("LINESTRING(3 0,2 0,0 0)", "LINESTRING(2 2,1 1,0 0)", true); test_geometry("LINESTRING(0 0,2 0,3 0)", "LINESTRING(1 0,4 0,5 0)", true); test_geometry("LINESTRING(1 0,2 0)", "LINESTRING(1 0,0 0)", true); } template void test_intersects_linestring_polygon() { typedef bg::model::linestring

ls; typedef bg::model::multi_linestring mls; typedef bg::model::polygon

poly_cw_c; typedef bg::model::polygon poly_ccw_c; typedef bg::model::polygon poly_ccw_o; typedef bg::model::multi_polygon mpoly_ccw_c; test_geometry("LINESTRING(1 1,2 2)", "POLYGON((0 0,10 0,10 10,0 10,0 0))", true); test_geometry("LINESTRING(1 0,2 2)", "POLYGON((0 0,10 0,10 10,0 10,0 0))", true); test_geometry("LINESTRING(11 0,12 12)", "POLYGON((0 0,10 0,10 10,0 10,0 0))", false); test_geometry("LINESTRING(1 1, 3 3, 2 5)", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", true); test_geometry("LINESTRING(6 6, 7 6, 7 7, 6 7)", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", false); test_geometry("LINESTRING(7 7, 9 7, 9 9, 7 9)", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", true); test_geometry("POLYGON((0 0, 0 10, 10 10, 10 0, 0 0))", "LINESTRING(-2 -2, 12 7)", true); test_geometry("POLYGON((0 0, 0 10, 10 10, 10 0, 0 0))", "LINESTRING(5 5, 15 4)", true); test_geometry("POLYGON((0 0, 0 10, 10 10, 10 0, 0 0))", "LINESTRING(7 6, 15 4)", true); test_geometry("POLYGON((0 0, 0 10, 10 10, 10 0, 0 0))", "LINESTRING(6 2, 12 1)", true); // MULTI test_geometry("LINESTRING(1 1,2 2)", "MULTIPOLYGON(((0 0,10 0,10 10,0 10,0 0)))", true); test_geometry("MULTILINESTRING((1 1,2 2))", "MULTIPOLYGON(((0 0,10 0,10 10,0 10,0 0)))", true); } template void test_intersects_linestring_ring() { typedef bg::model::linestring

ls; typedef bg::model::multi_linestring mls; typedef bg::model::ring ring_ccw_c; test_geometry("LINESTRING(1 1,2 2)", "POLYGON((0 0,10 0,10 10,0 10,0 0))", true); test_geometry("LINESTRING(1 0,2 2)", "POLYGON((0 0,10 0,10 10,0 10,0 0))", true); test_geometry("LINESTRING(11 0,12 12)", "POLYGON((0 0,10 0,10 10,0 10,0 0))", false); // MULTI test_geometry("MULTILINESTRING((1 1,2 2))", "POLYGON((0 0,10 0,10 10,0 10,0 0))", true); } template void test_intersects_ring_polygon() { typedef bg::model::ring ring_ccw_o; typedef bg::model::polygon poly_ccw_o; test_geometry("POLYGON((1 1, 3 3, 2 5))", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", true); test_geometry("POLYGON((6 6, 7 6, 7 7, 6 7))", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", false); test_geometry("POLYGON((7 7, 9 7, 9 9, 7 9))", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", true); test_geometry("POLYGON((6 6,7 6,7 7,6 7))", "POLYGON((0 0, 9 0, 9 9, 0 9),(5 5,5 8,8 8,8 5))", false); } template void test_intersects_point_linestring() { typedef bg::model::linestring

ls; typedef bg::model::multi_linestring mls; test_geometry("POINT(0 0)", "LINESTRING(0 0,2 2,4 0)", true); test_geometry("POINT(1 1)", "LINESTRING(0 0,2 2,4 0)", true); test_geometry("POINT(1 0)", "LINESTRING(0 0,2 2,4 0)", false); // MULTI test_geometry("POINT(0 0)", "MULTILINESTRING((0 0,2 2,4 0))", true); } template void test_all() { typedef bg::model::polygon

polygon; typedef bg::model::ring

ring; // intersect <=> ! disjoint (in most cases) // so most tests are done in disjoint test. // We only test compilation of a few cases. test_geometry >("POINT(1 1)", "BOX(0 0,2 2)", true); test_geometry >( "POLYGON((1992 3240,1992 1440,3792 1800,3792 3240,1992 3240))", "BOX(1941 2066, 2055 2166)", true); test_geometry >( "POLYGON((1992 3240,1992 1440,3792 1800,3792 3240,1992 3240))", "BOX(1941 2066, 2055 2166)", true); test_geometry >( "POLYGON((1941 2066,2055 2066,2055 2166,1941 2166))", "BOX(1941 2066, 2055 2166)", true); test_intersects_point_linestring

(); test_intersects_polygon_polygon

(); test_intersects_linestring_polygon

(); test_intersects_linestring_ring

(); test_intersects_linestring_segment

(); test_intersects_linestring_linestring

(); test_intersects_ring_polygon

(); // self-intersecting is not tested in disjoint, so that is done here. // Just a normal polygon test_self_intersects("POLYGON((0 0,0 4,1.5 2.5,2.5 1.5,4 0,0 0))", false); // Self intersecting test_self_intersects("POLYGON((1 2,1 1,2 1,2 2.25,3 2.25,3 0,0 0,0 3,3 3,2.75 2,1 2))", true); // Self intersecting in last segment test_self_intersects("POLYGON((0 2,2 4,2 0,4 2,0 2))", true); // Self tangent test_self_intersects("POLYGON((0 0,0 4,4 4,4 0,2 4,0 0))", true); // Self tangent in corner test_self_intersects("POLYGON((0 0,0 4,4 4,4 0,0 4,2 0,0 0))", true); // With spike test_self_intersects("POLYGON((0 0,0 4,4 4,4 2,6 2,4 2,4 0,0 0))", true); // Non intersection, but with duplicate test_self_intersects("POLYGON((0 0,0 4,4 0,4 0,0 0))", false); // With many duplicates test_self_intersects( "POLYGON((0 0,0 1,0 1,0 1,0 2,0 2,0 3,0 3,0 3,0 3,0 4,2 4,2 4,4 4,4 0,4 0,3 0,3 0,3 0,3 0,3 0,0 0))", false); // Hole: interior tangent to exterior test_self_intersects("POLYGON((0 0,0 4,4 4,4 0,0 0),(1 2,2 4,3 2,1 2))", true); // Hole: interior intersecting exterior test_self_intersects("POLYGON((0 0,0 4,4 4,4 0,0 0),(1 1,1 3,5 4,1 1))", true); // Hole: two intersecting holes test_self_intersects( "POLYGON((0 0,0 4,4 4,4 0,0 0),(1 1,1 3,3 3,3 1,1 1),(2 2,2 3.5,3.5 3.5,3.5 2,2 2))", true); // Mail Akira T on [Boost-users] at 27-7-2011 3:17 test_self_intersects >( "LINESTRING(0 0,0 4,4 4,2 2,2 5)", true); test_self_intersects >( "LINESTRING(0 4,4 4,2 2,2 5)", true); // Test self-intersections at last segment in close/open rings: test_self_intersects >( "POLYGON((0 0,3 3,4 1,0 0))", false); test_self_intersects >( "POLYGON((0 0,3 3,4 1))", false); test_self_intersects >( "POLYGON((0 0,3 3,4 1,0 1,0 0))", true); test_self_intersects >( "POLYGON((0 0,3 3,4 1,0 1))", true); // Duplicates in first or last test_self_intersects >( "POLYGON((0 0,3 3,4 1,0 1,0 1,0 0))", true); test_self_intersects >( "POLYGON((0 0,3 3,4 1,0 1,0 0,0 0))", true); test_self_intersects >( "POLYGON((0 0,3 3,4 1,0 1,0 1))", true); test_self_intersects >( "POLYGON((0 0,0 0,3 3,4 1,0 1,0 1,0 0))", true); test_self_intersects >( "POLYGON((0 0,0 0,3 3,4 1,0 1,0 1))", true); test_self_intersects >( "POLYGON((0 0,3 3,3 3,4 1,0 1,0 1,0 0))", true); test_self_intersects >( "POLYGON((0 0,3 3,3 3,4 1,0 1,0 1))", true); test_self_intersects >( "POLYGON((0 0,3 3,4 1,0 0,0 0))", false); test_self_intersects >( "POLYGON((0 0,3 3,4 1,4 1,0 0))", false); test_self_intersects >( "POLYGON((0 0,3 3,4 1,4 1))", false); test_self_intersects >( "POLYGON((0 0,0 0,3 3,4 1,0 0))", false); test_self_intersects >( "POLYGON((0 0,0 0,3 3,4 1))", false); test_self_intersects >( "POLYGON((0 0,3 3,3 3,4 1,0 0))", false); test_self_intersects >( "POLYGON((0 0,3 3,3 3,4 1))", false); test_geometry >( "POINT(0 0)", "BOX(0 0,4 4)", true); test_geometry >( "POINT(0 0)", "POLYGON((0 0,3 3,3 3,4 1))", true); test_geometry >( "POINT(0 0)", "POLYGON((0 0,3 3,3 3,4 1))", true); test_geometry, P>( "POLYGON((0 0,3 3,3 3,4 1))", "POINT(0 0)", true); test_geometry, P>( "POLYGON((0 0,3 3,3 3,4 1))", "POINT(0 0)", true); } // Those tests won't pass for rational<> because numeric_limits<> isn't specialized for this type template void test_additional() { test_geometry, bg::model::box

>( "SEGMENT(0 0,3 3)", "BOX(1 2,3 5)", true); test_geometry, bg::model::box

>( "SEGMENT(1 1,2 3)", "BOX(0 0,4 4)", true); test_geometry, bg::model::box

>( "SEGMENT(1 1,1 1)", "BOX(1 0,3 5)", true); test_geometry, bg::model::box

>( "SEGMENT(0 1,0 1)", "BOX(1 0,3 5)", false); test_geometry, bg::model::box

>( "SEGMENT(2 1,2 1)", "BOX(1 0,3 5)", true); test_geometry, bg::model::box

>( "LINESTRING(0 0,1 0,10 10)", "BOX(1 2,3 5)", true); test_geometry, bg::model::box

>( "LINESTRING(1 2)", "BOX(0 0,3 5)", true); } int test_main( int , char* [] ) { test_all >(); test_additional >(); test_all > >(); #if defined(HAVE_TTMATH) test_all >(); #endif return 0; }