CGAL 5.6.3 - Bounding Volumes

Loading...
Searching...
No Matches
Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Polygon_2.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/random_convex_set_2.h>
#include <CGAL/min_quadrilateral_2.h>
#include <iostream>
typedef CGAL::Simple_cartesian<double> Kernel;
typedef Kernel::Point_2 Point_2;
typedef Kernel::Line_2 Line_2;
typedef CGAL::Polygon_2<Kernel> Polygon_2;
typedef CGAL::Random_points_in_square_2<Point_2> Generator;
int main()
{
// build a random convex 20-gon p
Polygon_2 p;
CGAL::random_convex_set_2(20, std::back_inserter(p), Generator(1.0));
std::cout << p << std::endl;
// compute the minimal enclosing parallelogram p_m of p
Polygon_2 p_m;
CGAL::min_parallelogram_2(
p.vertices_begin(), p.vertices_end(), std::back_inserter(p_m));
std::cout << p_m << std::endl;
return 0;
}
Kernel::Line_2
Kernel::Point_2
CGAL::min_parallelogram_2
OutputIterator min_parallelogram_2(ForwardIterator points_begin, ForwardIterator points_end, OutputIterator o, Traits &t=Default_traits)
computes a minimum area enclosing parallelogram of the point set described by [points_begin,...
Kernel
CGAL::Simple_cartesian