mirror of
https://github.com/boostorg/geometry.git
synced 2025-05-10 07:34:03 +00:00
87 lines
3.1 KiB
C++
87 lines
3.1 KiB
C++
// Boost.Geometry (aka GGL, Generic Geometry Library) test file
|
|
//
|
|
// Copyright Barend Gehrels 2007-2009, Geodan, Amsterdam, the Netherlands
|
|
// Copyright Bruno Lalande 2008, 2009
|
|
// 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 <algorithms/test_area.hpp>
|
|
|
|
#include <boost/geometry/geometries/point.hpp>
|
|
#include <boost/geometry/geometries/box.hpp>
|
|
#include <boost/geometry/geometries/linear_ring.hpp>
|
|
#include <boost/geometry/geometries/polygon.hpp>
|
|
|
|
//#define GGL_TEST_DEBUG
|
|
|
|
|
|
|
|
|
|
template <typename P>
|
|
void test_all()
|
|
{
|
|
//test_area_circle<P, double>();
|
|
test_geometry<boost::geometry::box<P> >("POLYGON((0 0,2 2))", 4.0);
|
|
test_geometry<boost::geometry::box<P> >("POLYGON((2 2,0 0))", 4.0);
|
|
|
|
// clockwise rings (second is wrongly ordered)
|
|
test_geometry<boost::geometry::linear_ring<P> >("POLYGON((0 0,0 7,4 2,2 0,0 0))", 16.0);
|
|
test_geometry<boost::geometry::linear_ring<P> >("POLYGON((0 0,2 0,4 2,0 7,0 0))", -16.0);
|
|
|
|
// counter clockwise rings (first is wrongly ordered)
|
|
test_geometry<boost::geometry::linear_ring<P, std::vector, false> >
|
|
("POLYGON((0 0,0 7,4 2,2 0,0 0))", -16.0);
|
|
test_geometry<boost::geometry::linear_ring<P, std::vector, false> >
|
|
("POLYGON((0 0,2 0,4 2,0 7,0 0))", 16.0);
|
|
|
|
test_geometry<boost::geometry::polygon<P> >("POLYGON((0 0,0 7,4 2,2 0,0 0))", 16.0);
|
|
test_geometry<boost::geometry::polygon<P> >("POLYGON((1 1,2 1,2 2,1 2,1 1))", -1.0);
|
|
test_geometry<boost::geometry::polygon<P> >
|
|
("POLYGON((0 0,0 7,4 2,2 0,0 0), (1 1,2 1,2 2,1 2,1 1))", 15.0);
|
|
test_geometry<boost::geometry::polygon<P, std::vector, std::vector, false> >
|
|
("POLYGON((0 0,0 7,4 2,2 0,0 0), (1 1,2 1,2 2,1 2,1 1))", -15.0);
|
|
}
|
|
|
|
template <typename Point>
|
|
void test_spherical()
|
|
{
|
|
boost::geometry::polygon<Point> geometry;
|
|
|
|
// unit-sphere has area of 4-PI. Polygon covering 1/8 of it:
|
|
double expected = 4.0 * boost::geometry::math::pi / 8.0;
|
|
boost::geometry::read_wkt("POLYGON((0 0,0 90,90 0,0 0))", geometry);
|
|
|
|
double area = boost::geometry::area(geometry);
|
|
BOOST_CHECK_CLOSE(area, expected, 0.0001);
|
|
|
|
// With strategy, radius 2 -> 4 pi r^2
|
|
boost::geometry::strategy::area::huiller
|
|
<
|
|
typename boost::geometry::point_type<Point>::type
|
|
> strategy(2.0);
|
|
|
|
area = boost::geometry::area(geometry, strategy);
|
|
BOOST_CHECK_CLOSE(area, 2.0 * 2.0 * expected, 0.0001);
|
|
}
|
|
|
|
|
|
int test_main(int, char* [])
|
|
{
|
|
test_all<boost::geometry::point<int, 2, boost::geometry::cs::cartesian> >();
|
|
test_all<boost::geometry::point<float, 2, boost::geometry::cs::cartesian> >();
|
|
test_all<boost::geometry::point<double, 2, boost::geometry::cs::cartesian> >();
|
|
|
|
test_spherical<boost::geometry::point<double, 2, boost::geometry::cs::spherical<boost::geometry::degree> > >();
|
|
|
|
#if defined(HAVE_CLN)
|
|
test_all<boost::geometry::point_xy<boost::numeric_adaptor::cln_value_type> >();
|
|
#endif
|
|
#if defined(HAVE_GMP)
|
|
test_all<boost::geometry::point_xy<boost::numeric_adaptor::gmp_value_type> >();
|
|
#endif
|
|
|
|
return 0;
|
|
}
|