cgal/Partition_2/test/Partition_2/test_greene_approx_convex.h

47 lines
2.0 KiB
C++

void test_greene_approx_convex()
{
Polygon_2 polygon;
std::list<Polygon_2> partition_polys;
polygon.erase(polygon.vertices_begin(), polygon.vertices_end());
make_monotone_convex(polygon);
CGAL::greene_approx_convex_partition_2(polygon.vertices_begin(),
polygon.vertices_end(),
std::back_inserter(partition_polys));
assert (partition_polys.size() == 1 &&
partition_polys.front().size() == polygon.size());
assert(CGAL::is_convex_2(partition_polys.front().vertices_begin(),
partition_polys.front().vertices_end()));
partition_polys.clear();
polygon.erase(polygon.vertices_begin(), polygon.vertices_end());
make_convex_w_collinear_points(polygon);
CGAL::greene_approx_convex_partition_2(polygon.vertices_begin(),
polygon.vertices_end(),
std::back_inserter(partition_polys));
partition_polys.clear();
polygon.erase(polygon.vertices_begin(), polygon.vertices_end());
make_nonconvex_w_collinear_points(polygon);
CGAL::greene_approx_convex_partition_2(polygon.vertices_begin(),
polygon.vertices_end(),
std::back_inserter(partition_polys));
partition_polys.clear();
polygon.erase(polygon.vertices_begin(), polygon.vertices_end());
make_nonconvex(polygon);
CGAL::greene_approx_convex_partition_2(polygon.vertices_begin(),
polygon.vertices_end(),
std::back_inserter(partition_polys));
/*
partition_polys.clear();
polygon.erase(polygon.vertices_begin(), polygon.vertices_end());
make_hilbert_polygon(polygon);
CGAL::greene_approx_convex_partition_2(polygon.vertices_begin(),
polygon.vertices_end(),
std::back_inserter(partition_polys));
*/
}