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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
// Copyright (c) 2006-2009 Max-Planck-Institute Saarbruecken (Germany).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/shear.h $
// $Id: include/CGAL/Algebraic_kernel_d/shear.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Michael Kerber <mkerber@mpi-inf.mpg.de>
//
// ============================================================================
#ifndef CGAL_ACK_SHEAR_H
#define CGAL_ACK_SHEAR_H 1
#include <CGAL/basic.h>
#include <CGAL/Polynomial_traits_d.h>
#include <utility>
#include <vector>
#include <functional>
#include <iterator>
#include <CGAL/boost/iterator/transform_iterator.hpp>
#include <CGAL/boost/iterator/counting_iterator.hpp>
namespace CGAL {
namespace internal {
/*! \ingroup NiX_bivariate_polynomial_hacks
* \brief Computes the polynomial f(x+sy,y)
*/
template<class NT>
CGAL::Polynomial<CGAL::Polynomial<NT> >
shear(const CGAL::Polynomial<CGAL::Polynomial<NT> >& f,NT s) {
typedef CGAL::Polynomial<NT> Poly_1;
typedef CGAL::Polynomial<Poly_1> Poly_2;
Poly_1 x(NT(0),NT(1));
Poly_1 zero(NT(0));
Poly_1 one(NT(1));
Poly_2 for_x(x,Poly_1(NT(s)));
Poly_2 for_y(zero,one);
std::vector<Poly_2> coeffs;
coeffs.push_back(for_x);
coeffs.push_back(for_y);
return typename CGAL::Polynomial_traits_d<Poly_2>::Substitute()
(f,coeffs.begin(), coeffs.end());
}
} // namespace internal
} //namespace CGAL
#endif // NiX_BIVARIATE_POLYNOMIAL_HACKS_H
// EOF
|
