// 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 2014.
+// Modifications copyright (c) 2014 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)
+// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
+
#include <algorithms/test_within.hpp>
#include <boost/geometry/geometries/geometries.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
-
+#include <boost/geometry/multi/multi.hpp>
+#include <boost/geometry/multi/geometries/multi_point.hpp>
+#include <boost/geometry/multi/geometries/multi_linestring.hpp>
+#include <boost/geometry/multi/geometries/multi_polygon.hpp>
template <typename P>
void test_all()
{
- // trivial case
- test_ring<P>("POINT(1 1)", "POLYGON((0 0,0 2,2 2,2 0,0 0))", true, false);
-
- // on border/corner
- test_ring<P>("POINT(0 0)", "POLYGON((0 0,0 2,2 2,2 0,0 0))", false, true);
- test_ring<P>("POINT(0 1)", "POLYGON((0 0,0 2,2 2,2 0,0 0))", false, true);
-
- // aligned to segment/vertex
- test_ring<P>("POINT(1 1)", "POLYGON((0 0,0 3,3 3,3 1,2 1,2 0,0 0))", true, false);
- test_ring<P>("POINT(1 1)", "POLYGON((0 0,0 3,4 3,3 1,2 2,2 0,0 0))", true, false);
-
- // same polygon, but point on border
- test_ring<P>("POINT(3 3)", "POLYGON((0 0,0 3,3 3,3 1,2 1,2 0,0 0))", false, true);
- test_ring<P>("POINT(3 3)", "POLYGON((0 0,0 3,4 3,3 1,2 2,2 0,0 0))", false, true);
-
- // holes
- test_geometry<P, bg::model::polygon<P> >("POINT(2 2)",
- "POLYGON((0 0,0 4,4 4,4 0,0 0),(1 1,3 1,3 3,1 3,1 1))", false);
-
typedef bg::model::box<P> box_type;
test_geometry<P, box_type>("POINT(1 1)", "BOX(0 0,2 2)", true);
test_geometry<box_type, box_type>("BOX(1 1,2 2)", "BOX(0 0,3 3)", true);
test_geometry<box_type, box_type>("BOX(0 0,3 3)", "BOX(1 1,2 2)", false);
+ test_geometry<box_type, box_type>("BOX(1 1,3 3)", "BOX(0 0,3 3)", true);
+ test_geometry<box_type, box_type>("BOX(3 1,3 3)", "BOX(0 0,3 3)", false);
+
/*
test_within_code<P, box_type>("POINT(1 1)", "BOX(0 0,2 2)", 1);
test_within_code<P, box_type>("POINT(1 0)", "BOX(0 0,2 2)", 0);
test_within_code<box_type, box_type>("BOX(1 1,3 2)", "BOX(0 0,3 3)", 0);
test_within_code<box_type, box_type>("BOX(1 1,3 4)", "BOX(0 0,3 3)", -1);
*/
-
- // Real-life problem (solved now), point is in the middle, 409623 is also a coordinate
- // on the border, has been wrong in the past (2009)
- test_ring<P>("POINT(146383 409623)",
- "POLYGON((146351 410597,146521 410659,147906 410363,148088 410420"
- ",148175 410296,148281 409750,148215 409623,148154 409666,148154 409666"
- ",148130 409625,148035 409626,148035 409626,148008 409544,147963 409510"
- ",147993 409457,147961 409352,147261 408687,147008 408586,145714 408840"
- ",145001 409033,144486 409066,144616 409308,145023 410286,145254 410488"
- ",145618 410612,145618 410612,146015 410565,146190 410545,146351 410597))",
- true, false);
}
template <typename Point>
void test_spherical()
{
- typedef typename bg::coordinate_type<Point>::type ct;
- bg::model::polygon<Point> wrangel;
-
- // SQL Server check (no geography::STWithin, so check with intersection trick)
- /*
-
- with q as (
- select geography::STGeomFromText('POLYGON((-178.569 71.5641,-179.034 71.5977,-179.305 71.5514,-179.629 71.5772,-180 71.5358,179.53 71.4383,178.872 71.2175,178.618 71.0355,178.791 70.7964,179.273 70.8886,179.678 70.8955,-180 70.9972,-179.274 70.9078,-178.819 70.98,-177.939 71.0375,-177.62 71.1166,-177.439 71.2269,-177.503 71.2775,-177.833 71.3461,-178.018 71.4497,-178.569 71.5641))',4326) as wrangel
- )
-
- select wrangel.STArea()/1000000.0
- ,geography::STGeomFromText('POINT(-179.3 71.27)',4326).STIntersection(wrangel).STAsText() as workaround_within_1
- ,geography::STGeomFromText('POINT(-179.9 70.95)',4326).STIntersection(wrangel).STAsText() as workaround_within_2
- ,geography::STGeomFromText('POINT(179.9 70.95)',4326).STIntersection(wrangel).STAsText() as workaround_within_3
- from q
-
- -> 7669.10402181435 POINT (-179.3 71.27) GEOMETRYCOLLECTION EMPTY GEOMETRYCOLLECTION EMPTY
-
- PostGIS knows Within for Geography neither, and the intersection trick gives the same result
-
- */
-
- bg::read_wkt("POLYGON((-178.568604 71.564148,-178.017548 71.449692,-177.833313 71.3461,-177.502838 71.277466 ,-177.439453 71.226929,-177.620026 71.116638,-177.9389 71.037491,-178.8186 70.979965,-179.274445 70.907761,-180 70.9972,179.678314 70.895538,179.272766 70.888596,178.791016 70.7964,178.617737 71.035538,178.872192 71.217484,179.530273 71.4383 ,-180 71.535843 ,-179.628601 71.577194,-179.305298 71.551361,-179.03421 71.597748,-178.568604 71.564148))", wrangel);
-
- bool within = bg::within(Point(-179.3, 71.27), wrangel);
- BOOST_CHECK_EQUAL(within, true);
-
- within = bg::within(Point(-179.9, 70.95), wrangel);
- BOOST_CHECK_EQUAL(within, false);
-
- within = bg::within(Point(179.9, 70.95), wrangel);
- BOOST_CHECK_EQUAL(within, false);
-
- // Test using great circle mapper
- // http://www.gcmap.com/mapui?P=5E52N-9E53N-7E50N-5E52N,7E52.5N,8E51.5N,6E51N
-
- bg::model::polygon<Point> triangle;
- bg::read_wkt("POLYGON((5 52,9 53,7 50,5 52))", triangle);
- BOOST_CHECK_EQUAL(bg::within(Point(7, 52.5), triangle), true);
- BOOST_CHECK_EQUAL(bg::within(Point(8.0, 51.5), triangle), false);
- BOOST_CHECK_EQUAL(bg::within(Point(6.0, 51.0), triangle), false);
-
// Test spherical boxes
// See also http://www.gcmap.com/mapui?P=1E45N-19E45N-19E55N-1E55N-1E45N,10E55.1N,10E45.1N
bg::model::box<Point> box;
BOOST_CHECK_EQUAL(bg::within(point_type(2, 4, 2), box), false);
BOOST_CHECK_EQUAL(bg::within(point_type(2, 2, 4), box), false);
BOOST_CHECK_EQUAL(bg::within(point_type(2, 2, 5), box), false);
+
+ box_type box2(point_type(2, 2, 2), point_type(3, 3, 3));
+ BOOST_CHECK_EQUAL(bg::within(box2, box), true);
+
}
template <typename P1, typename P2>
typedef boost::geometry::model::box<P1> box_type1;
typedef boost::geometry::model::box<P2> box_type2;
- polygon_type1 poly1, poly2;
+ polygon_type1 poly1;
+ polygon_type2 poly2;
boost::geometry::read_wkt("POLYGON((0 0,0 5,5 5,5 0,0 0))", poly1);
boost::geometry::read_wkt("POLYGON((0 0,0 5,5 5,5 0,0 0))", poly2);
typedef bg::model::box<point_type> box_type;
point_type p(3, 3);
box_type b(point_type(0, 0), point_type(5, 5));
+ box_type b0(point_type(0, 0), point_type(5, 0));
- bool r = bg::within(p, b,
+ bool r = bg::within(p, b,
bg::strategy::within::point_in_box<point_type, box_type>());
+ BOOST_CHECK_EQUAL(r, true);
- r = bg::within(b, b,
+ r = bg::within(b, b,
bg::strategy::within::box_in_box<box_type, box_type>());
+ BOOST_CHECK_EQUAL(r, true);
- r = bg::within(p, b,
+ r = bg::within(b0, b0,
+ bg::strategy::within::box_in_box<box_type, box_type>());
+ BOOST_CHECK_EQUAL(r, false);
+
+ r = bg::within(p, b,
bg::strategy::within::point_in_box_by_side<point_type, box_type>());
+ BOOST_CHECK_EQUAL(r, true);
}
-void test_large_integers()
-{
- typedef bg::model::point<int, 2, bg::cs::cartesian> int_point_type;
- typedef bg::model::point<double, 2, bg::cs::cartesian> double_point_type;
-
- std::string const polygon_li = "POLYGON((1872000 528000,1872000 192000,1536119 192000,1536000 528000,1200000 528000,1200000 863880,1536000 863880,1872000 863880,1872000 528000))";
- bg::model::polygon<int_point_type> int_poly;
- bg::model::polygon<double_point_type> double_poly;
- bg::read_wkt(polygon_li, int_poly);
- bg::read_wkt(polygon_li, double_poly);
-
- std::string const point_li = "POINT(1592000 583950)";
- int_point_type int_point;
- double_point_type double_point;
- bg::read_wkt(point_li, int_point);
- bg::read_wkt(point_li, double_point);
-
- bool wi = bg::within(int_point, int_poly);
- bool wd = bg::within(double_point, double_poly);
-
- BOOST_CHECK_MESSAGE(wi == wd, "within<a double> different from within<an int>");
-}
-
int test_main( int , char* [] )
{
- test_large_integers();
-
test_all<bg::model::d2::point_xy<int> >();
test_all<bg::model::d2::point_xy<double> >();
projects / platform / upstream / boost.git / blobdiff