1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
//! \file examples/Minkowski_sum_2/sum_by_decomposition.cpp
// Computing the Minkowski sum of two non-convex polygons read from a file
// using the small-side angle-bisector decomposition strategy.
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <CGAL/minkowski_sum_2.h>
#include <CGAL/Polygon_vertical_decomposition_2.h>
#include <iostream>
#include <fstream>
#include "print_utils.h"
typedef CGAL::Exact_predicates_exact_constructions_kernel Kernel;
typedef Kernel::Point_2 Point_2;
typedef CGAL::Polygon_2<Kernel> Polygon_2;
typedef CGAL::Polygon_with_holes_2<Kernel> Polygon_with_holes_2;
int main()
{
// Open the input file.
std::ifstream in_file("holes.dat");
if (! in_file.is_open()) {
std::cerr << "Failed to open the input file." << std::endl;
return -1;
}
// Read the two polygons from the file and compute their Minkowski sum.
Polygon_with_holes_2 P, Q;
in_file >> P >> Q;
in_file.close();
// Compute the Minkowski sum using the decomposition approach.
CGAL::Polygon_vertical_decomposition_2<Kernel>::Traits_2 traits;
CGAL::Polygon_vertical_decomposition_2<Kernel> vertical_decomp(traits);
Polygon_with_holes_2 sum = minkowski_sum_2(P, Q, vertical_decomp, traits);
std::cout << "P (+) Q = ";
print_polygon_with_holes(sum);
return 0;
}
|
