1 #include <CGAL/Polynomial.h>
2 #include <CGAL/Polynomial_traits_d.h>
3 #include <CGAL/Polynomial_type_generator.h>
4
main()5 int main(){
6 CGAL::IO::set_pretty_mode(std::cout);
7 typedef CGAL::Polynomial_type_generator<int,3>::Type Poly_3;
8 typedef CGAL::Polynomial_traits_d<Poly_3> PT_3;
9
10 //construction using shift
11 Poly_3 x = PT_3::Shift()(Poly_3(1),1,0); // x_0^1
12 Poly_3 y = PT_3::Shift()(Poly_3(1),1,1); // x_1^1
13 Poly_3 z = PT_3::Shift()(Poly_3(1),1,2); // x_2^1
14
15
16 Poly_3 F = x*y*y*z*z*z;
17 std::cout << "The trivariate polynomial F: " << F << std::endl;
18 std::cout << std::endl;
19
20 PT_3::Swap swap;
21 PT_3::Move move;
22 PT_3::Permute permute;
23
24 std::cout << "x and z swapped: "<< swap(F,0,2) // = x^3*y^2*z
25 << std::endl;
26 std::cout << "x and y swapped: "<< swap(F,0,1) // = x^2*y*z^3
27 << std::endl << std::endl;
28
29 std::cout << "x moved to outermost position : "
30 << move(F,0,2) // = x^2*y^3*z
31 << std::endl;
32 std::cout << "Same as swap(swap(F,0,1),1,2) : "
33 << swap(swap(F,0,1),1,2) // = x^2*y^3*z
34 << std::endl;
35
36 std::cout << "Same as the permutation (0,1,2)->(2,0,1): ";
37 std::vector<int> perm;
38 perm.push_back(2);perm.push_back(0);perm.push_back(1);
39 std::cout << permute(F,perm.begin(),perm.end())// = x^2*y^3*z
40 << std::endl;
41
42 }
43