| ▼NCGAL | |
| CAlgebraic_kernel_d_1 | The class represents an algebraic real root by a square free polynomial and an isolating interval that uniquely defines the root |
| CAlgebraic_kernel_d_2 | This class gathers necessary tools for solving and handling bivariate polynomial systems of general degree \( d\) |
| CAlgebraic_kernel_rs_gmpq_d_1 | |
| CAlgebraic_kernel_rs_gmpz_d_1 | |
| ▼CAlgebraicKernel_d_1 | A model of the AlgebraicKernel_d_1 concept is meant to provide the algebraic functionalities on univariate polynomials of general degree \( d\) |
| CApproximateAbsolute_1 | A model of AlgebraicKernel_d_1::ApproximateAbsolute_1 is an AdaptableBinaryFunction that computes an approximation of an AlgebraicKernel_d_1::Algebraic_real_1 value with respect to a given absolute precision |
| CApproximateRelative_1 | A model of AlgebraicKernel_d_1::ApproximateRelative_1 is an AdaptableBinaryFunction that computes an approximation of an AlgebraicKernel_d_1::Algebraic_real_1 value with respect to a given relative precision |
| CBoundBetween_1 | Computes a number of type AlgebraicKernel_d_1::Bound in-between two AlgebraicKernel_d_1::Algebraic_real_1 values |
| CCompare_1 | Compares AlgebraicKernel_d_1::Algebraic_real_1 values |
| CComputePolynomial_1 | Computes a square free univariate polynomial \( p\), such that the given AlgebraicKernel_d_1::Algebraic_real_1 is a root of \( p\) |
| CConstructAlgebraicReal_1 | Constructs AlgebraicKernel_d_1::Algebraic_real_1 |
| CIsCoprime_1 | Determines whether a given pair of univariate polynomials \( p_1, p_2\) is coprime, namely if \( \deg({\rm gcd}(p_1 ,p_2)) = 0\) |
| CIsolate_1 | Computes an open isolating interval for an AlgebraicKernel_d_1::Algebraic_real_1 with respect to the real roots of a given univariate polynomial |
| CIsSquareFree_1 | Computes whether the given univariate polynomial is square free |
| CIsZeroAt_1 | Computes whether an AlgebraicKernel_d_1::Polynomial_1 is zero at a given AlgebraicKernel_d_1::Algebraic_real_1 |
| CMakeCoprime_1 | Computes for a given pair of univariate polynomials \( p_1\), \( p_2\) their common part \( g\) up to a constant factor and coprime parts \( q_1\), \( q_2\) respectively |
| CMakeSquareFree_1 | Returns a square free part of a univariate polynomial |
| CNumberOfSolutions_1 | Computes the number of real solutions of the given univariate polynomial |
| CSignAt_1 | Computes the sign of a univariate polynomial AlgebraicKernel_d_1::Polynomial_1 at a real value of type AlgebraicKernel_d_1::Algebraic_real_1 |
| CSolve_1 | Computes the real roots of a univariate polynomial |
| CSquareFreeFactorize_1 | Computes a square free factorization of an AlgebraicKernel_d_1::Polynomial_1 |
| ▼CAlgebraicKernel_d_2 | A model of the AlgebraicKernel_d_2 concept gathers necessary tools for solving and handling bivariate polynomial systems of general degree \( d\) |
| CApproximateAbsoluteX_2 | A model of AlgebraicKernel_d_2::ApproximateAbsoluteX_2 is an AdaptableBinaryFunction that computes an approximation of the \( x\)-coordinate of an AlgebraicKernel_d_2::Algebraic_real_2 value with respect to a given absolute precision |
| CApproximateAbsoluteY_2 | A model of AlgebraicKernel_d_2::ApproximateAbsoluteY_2 is an AdaptableBinaryFunction that computes an approximation of the \( y\)-coordinate of an AlgebraicKernel_d_2::Algebraic_real_2 value with respect to a given absolute precision |
| CApproximateRelativeX_2 | A model of AlgebraicKernel_d_2::ApproximateRelativeX_2 is an AdaptableBinaryFunction that computes an approximation of the \( x\)-coordinate of an AlgebraicKernel_d_2::Algebraic_real_2 value with respect to a given relative precision |
| CApproximateRelativeY_2 | A model of AlgebraicKernel_d_2::ApproximateRelativeY_2 is an AdaptableBinaryFunction that computes an approximation of the \( y\)-coordinate of an AlgebraicKernel_d_2::Algebraic_real_2 value with respect to a given relative precision |
| CBoundBetweenX_2 | Computes a number of type AlgebraicKernel_d_1::Bound in-between the first coordinates of two AlgebraicKernel_d_2::AlgebraicReal_2 |
| CBoundBetweenY_2 | Computes a number of type AlgebraicKernel_d_1::Bound in-between the second coordinates of two AlgebraicKernel_d_2::AlgebraicReal_2 |
| CCompareX_2 | Compares the first coordinates of AlgebraicKernel_d_2::Algebraic_real_2s |
| CCompareXY_2 | Compares AlgebraicKernel_d_2::Algebraic_real_2s lexicographically |
| CCompareY_2 | Compares the second coordinated of AlgebraicKernel_d_2::Algebraic_real_2s |
| CComputePolynomialX_2 | Computes a univariate square free polynomial \( p\), such that the first coordinate of a given AlgebraicKernel_d_2::Algebraic_real_2 is a real root of \( p\) |
| CComputePolynomialY_2 | Computes a univariate square free polynomial \( p\), such that the second coordinate of a given AlgebraicKernel_d_2::Algebraic_real_2 is a real root of \( p\) |
| CComputeX_2 | Computes the first coordinate of an AlgebraicKernel_d_2::AlgebraicReal_2 |
| CComputeY_2 | Computes the second coordinate of an AlgebraicKernel_d_2::AlgebraicReal_2 |
| CConstructAlgebraicReal_2 | Constructs an AlgebraicKernel_d_2::Algebraic_real_2 |
| CIsCoprime_2 | Computes whether a given pair of bivariate polynomials is coprime |
| CIsolate_2 | Computes an isolating box for a given AlgebraicKernel_d_2::Algebraic_real_2 |
| CIsolateX_2 | Computes an isolating interval for the first coordinate of an AlgebraicKernel_d_2::Algebraic_real_2 with respect to the real roots of a univariate polynomial |
| CIsolateY_2 | Computes an isolating interval for the second coordinate of an AlgebraicKernel_d_2::Algebraic_real_2 with respect to the real roots of a univariate polynomial |
| CIsSquareFree_2 | Computes whether the given bivariate polynomial is square free |
| CIsZeroAt_2 | Computes whether an AlgebraicKernel_d_2::Polynomial_2 is zero at a given AlgebraicKernel_d_2::Algebraic_real_2 |
| CMakeCoprime_2 | Computes for a given pair of bivariate polynomials \( p_1\), \( p_2\) their common part \( g\) and coprime parts \( q_1\), \( q_2\) respectively |
| CMakeSquareFree_2 | Returns a square free part of a bivariate polynomial |
| CNumberOfSolutions_2 | Computes the number of real solutions of the given bivariate polynomial system |
| CSignAt_2 | Computes the sign of a bivariate polynomial AlgebraicKernel_d_2::Polynomial_2 at a value of type AlgebraicKernel_d_2::Algebraic_real_2 |
| CSolve_2 | Computes the real zero-dimensional solutions of a bivariate polynomial system. The multiplicity stored in the output iterator is the multiplicity in the system |
| CSquareFreeFactorize_2 | Computes a square free factorization of an AlgebraicKernel_d_2::Polynomial_2 |