PolynomialTraits_d::Canonicalize

Navigation: Up, Table of Contents, Package Overview, Bibliography, Index, Title Page , Acknowledging CGAL

PolynomialTraits_d::Canonicalize

Definition

For a given polynomial p this AdaptableUnaryFunction computes the unique representative of the set

:= { q | * q = p for some R },

where R is the base of the polynomial ring.

In case PolynomialTraits::Innermost_coefficient_type is a model of Field, the computed polynomial is the monic polynomial in , that is, the innermost leading coefficient equals one.
In case PolynomialTraits::Innermost_coefficient_type is a model of UniqueFactorizationDomain, the computed polynomial is the one with a multivariate content of one.
For all other cases the notion of uniqueness is up to the concrete model.

Note that the computed polynomial has the same zero set as the given one.

Refines

AdaptableUnaryFunction

Types

typedef PolynomialTraits_d::Polynomial_d
	result_type;
typedef PolynomialTraits_d::Polynomial_d
	argument_type;

Operations

result_type

fo ( first_argument_type p )

Returns the canonical representative of