CGAL 4.5 - Algebraic Kernel
|
Computes for a given pair of univariate polynomials p1, p2 their common part g up to a constant factor and coprime parts q1, q2 respectively.
That is, it computes g,q1,q2 such that:
c1⋅p1=g⋅q1 for some constant c1 and
c2⋅p2=g⋅q2 for some constant c2, such that q1 and q2 are coprime.
It returns true if p1 and p2 are already coprime.
AdaptableFunctor
with five arguments AlgebraicKernel_d_1::IsCoprime_1
Types | |
typedef bool | result_type |
Operations | |
result_type | operator() (const AlgebraicKernel_d_1::Polynomial_1 &p1, const AlgebraicKernel_d_1::Polynomial_1 &p2, AlgebraicKernel_d_1::Polynomial_1 &g, AlgebraicKernel_d_1::Polynomial_1 &q1, AlgebraicKernel_d_1::Polynomial_1 &q2) |
Computes g,q1,q2 as described above. More... | |
result_type AlgebraicKernel_d_1::MakeCoprime_1::operator() | ( | const AlgebraicKernel_d_1::Polynomial_1 & | p1, |
const AlgebraicKernel_d_1::Polynomial_1 & | p2, | ||
AlgebraicKernel_d_1::Polynomial_1 & | g, | ||
AlgebraicKernel_d_1::Polynomial_1 & | q1, | ||
AlgebraicKernel_d_1::Polynomial_1 & | q2 | ||
) |
Computes g,q1,q2 as described above.
Returns whether p1 and p2 where already coprime.