1. Introduction
The study of representations of rational curves and surfaces is a fundamental task in computer aided geometric design (CAGD) and computer algebra. There exist two typical problems in the study of representations.
Implicitization: for a rational parametric curve or surface, implicitization is to find an algebraic expression of the curve or surface.
Proper Reparametrization: for an improper rational parametric curve or surface, proper reparametrization is to find a proper parametric expression of the curve or surface.
The parametric expression of a curve or surface is widely used in geometric modeling, such as NURBS representations. The algebraic equation, which is also called implicit equation, is another important representation, and this is much better than the parametric expression in determining whether or not a point is on the curve or surface. Hence the implicitization problem is classical in CAGD and there are implicitization algorithms for rational curves and surfaces proposed over the past several decades [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14]. Among all of these techniques, the Gröbner bases [
2] is well-known, since it is theoretically complete. However, this method has exponential computational complexity and, thus, it is inefficient. This is the reason that people can not apply the Gröbner basis method for practical implicitization in application. Alternatively, in computational application, people prefer to find the implicit equations from certain implicit matrices. The implicit matrices can be constructed as resultant matrices or matrices of moving curves/surfaces. The implicit matrix of the curve is much simpler than that of the surface, since the curve only introduces one variable. Actually, the construction of bivariate resultant is not uniform and it is still a developing technique in computer algebra [
15,
16,
17,
18,
19,
20,
21]. The implicit matrix of moving curves/surfaces was introduced in [
10] and developed by more researchers [
5,
11,
22,
23,
24,
25]. The
-basis of a curve or surface was later defined by moving lines or moving planes with certain properties [
5,
23].
The implicit equation of the surface is generally included as a factor in its constructed resultants, but a constructed resultant may have extraneous factors that are not easy to identify and remove. For implicit matrices, some works attempt to construct the matrix whose determinant is exactly the implicit equation [
10,
24,
26,
27], but the ways to construct such implicit matrices are not complete for general surfaces. In the implicit matrix, there is more information than the implicit equation, such as singularities with multiplicity counting. Accordingly, people sometimes construct the implicit matrix by simple way and then the determinant of this matrix may have extraneous factors other than the implicit equation [
22]. For the matrix constructed from the
-basis of arbitrary three linearly independent syzygies, the extraneous factors are identified completely based on the analysis of base points or to parameters at infinity of tensor product surfaces [
11,
25], but some computations need the Gröbner bases of a zero dimensional algebraic variety.
When considering the proper reparametrization problem, an essential question is to decide whether a rational parametrization is proper. If a given rational parametrization is not proper, also called improper, a generic point lying on the variety corresponds to more than one parameter. On the other side, if a rational parametrization is improper, we ask whether it can be reparameterized, such that we can get a new proper parametrization. For algebraic curves, is well-known that the existence of a proper reparametrization for a given improper rational parametrization is certified by Lüroth’s Theorem [
28]. One can have a look, for instance, at a previous bibliography, as, for instance, [
29,
30,
31], where some efficient methods are proposed to find a proper reparametrization for an improper parametrization of an algebraic curve. For a given algebraic surface, Castelnuovo’s Theorem states that unirationality and rationality are equivalent over algebraically closed fields, but only some partial algorithmic methods approaching the problem are known (see [
30,
32]).
The
-basis was first used in [
17]. Here, the authors provided a representation for the implicit equation of a given curve defined parametrically. The
-basis developing as a new algebraic tool can be used to obtain the parametric equation of a rational curve or a rational surface, in order to compute the implicit equation defining these varieties, and to study singularities and intersections [
33]. There are several methods to compute the
-basis for rational curves by computing two moving lines that satisfy the required properties [
17], based on Gröbner basis [
34] or based on vector elimination [
23]. The
-basis has also been generalized to rational surfaces [
5], although the case of rational surfaces is different; for instance, the degrees of the
-basis elements can be different. An algorithm to compute a
-basis of a rational surface is designed that is based on polynomial matrix factorization [
35]. Another possible way is to compute a basis of the syzygy module of the surface with the application of Quillen–Suslin Theorem [
36,
37]. In order to avoid the extraneous factor in implicitization, people tried to find the strong
-bases of surfaces that have the very similar properties of the
-bases of curves. However, the surfaces with strong
-bases are relatively rare [
25,
38].
The
-basis has shown different advantages by assuming that the given parametrization is always proper. A recent result attempts to find inverse formula, proper reparametrization, and algebraic equation for an improper parametrization of an algebraic curve by using
-basis [
39]. In this paper, we pay attention to the
-basis of an improper parametrization of an algebraic surface and then apply the
-basis in the problems of proper reparametrization and implicitization. There are intrinsical differences in the discussions between the surface and the curve; hence, some results of the curve can not be extended to the surface straightforward. After we give the definition of
-basis of a rational parametric surface defined parametrically by
, we find the inversion formula (if
is proper) and the degree of the rational map that is induced by
while using the
-basis. Although the proper reparametrization problem is still opening, we address the problem of proper reparametrization partially based on the latest results and the properties of the
-basis. As an important application, we derive the implicitization formula from the
-basis from a given parametrization not being necessarily proper. Starting from the
-basis, the computations only involve greatest common divisors (gcds) and univariate resultants of some polynomials constructed from the
-basis. While the surface implicitization form
-basis involved the computation of Gröbner bases in [
5].
We have structured the article, as indicated below. In
Section 2, we present some important definitions and properties for the
-basis of rational surfaces. In
Section 3, given a rational parametrization
, we study the inversion computation (if
is proper) and the degree of the induced rational map. In
Section 4, we focus on the proper reparametrization problem while using
-basis. In
Section 5, we come to the implicitization problem from a given rational parametrization not necessarily proper using
-basis. We finish the paper with
Section 6, where we present a brief summary of our work.
2. -Basis for Rational Surfaces: Definition and Previous Results
Let
R denote the polynomial ring
over an algebraically closed field
of characteristic zero and
denote the set of
dimensional row vectors with entries in the polynomial ring
R. A submodule
M of
is a subset of
, for which this condition holds: for any
and
, we have
. A set of elements
, for
, is called a generating set of
M if for any
, there exist
, for
satisfying that
The Hilbert Basis Theorem states that every submodule
has a finite generating set. If, for any
, the above expression is unique, then
is called a basis of the module
M. If a module has a basis, then it is called a free module. For any
, the set
is a module over
R, called a syzygy module [
40]. An important result regarding syzygy modules is that if
are four relatively prime polynomials then, the syzygy module
is a free module of rank 3 (see [
5]).
Let
be a rational affine irreducible surface, and let
be a rational affine parametrization of
, where
. Sometimes, we write the parametrization in the homogenous coordinate form
and, in this case, we denote the surface in the projective space as
.
A moving surface of degree
l is a family of algebraic surfaces with parameter pairs
, where
are polynomials of degree
l, and
(called blending functions) are linearly independent. We say that a moving surface follows the rational surface
if
We observe that the implicit equation of a given rational surface
is a moving surface of
. A moving plane is a moving surface of degree one. We denote the next moving plane
by
. In the following, we denote, by
, the set of the moving planes that follow the rational surface that is parametrized by
. Thus,
is exactly the syzygy module
Now, we define the
-basis of the rational surface
.
Definition 1. Let be three moving planes satisfying that , where k is a nonzero constant. Subsequently, it is said that form a μ-basis of the rational surface . In the following, denotes the outer product of .
Geometrically, the above definition means that the point of rational surface
can be represented as the intersection of three moving planes
. This definition is generalized from the moving lines of a rational curves [
23]. Notice that the result in the curve case was proposed twenty years ago, but the surface case has been a mystery for a long time. The
-bases surfaces that have the very similar properties of the
-bases of curves is called strong
-basis, but the strong
-bases are relatively rare [
25]. Therefore, we have to study the
-basis of the surface from initial definition and, here, we review some basic theorems in [
5].
Theorem 1. For any rational surface , there always exist three moving planes , such that holds. In fact, any basis of satisfies the above equality.
Theorem 2. Let be a μ-basis of the rational surface . Thus, provide a basis for the module (hence, is a free module). That is, for any , there exist some polynomials , satisfying thatIn addition, the above expression is unique. An immediate consequence of the above theorems is that if form a -basis if and only if are a basis of
3. Inversion and Degree Using -Basis
Let
be an algebraically closed field of characteristic zero. We denote, by
, the defining polynomial of a rational affine irreducible surface
defined by the rational affine parametrization
The homogeneous implicit polynomial defining the corresponding the projective rational surface will be denoted as , where , and the parametrization in the homogenous coordinate form is given as .
Besides implicitization, other applications of -basis include, as in the case of algebraic curves, point inversion and, in general, the computation of the fiber. The point inversion problem can be stated, as follows: given a point Q on the space, decide whether the point is on a rational surface defined parametrically by or not, and, in the affirmative case, compute the corresponding parameter values , such that . In this section, we recall some efficient algorithms that allow for computing the point inversion and, in general, the computation of the degree of the rational map that is induced by . For this purpose, we will use -basis.
In order to deal with these problems, we first recall that, associated with the parametrization
, we consider the induced rational map
We denote, by
, the degree of the induced rational map
(see [
41] p. 143, and [
42] p. 80). Observe that the birationality of
, which is the properness of the input parametrization, is characterized by
(see [
41,
42]). We additionally remind that
determines the cardinality of the fiber of a generic element (see Theorem 7, p. 76 in [
41]). The degree measures the number of times the parametrization traces the curve when the parameter takes values in
. Finally, let
be the fiber of a point
; that is
In the following, given the projective parametrization
of a surface
and
a
-basis for
, we consider a generic point
on the surface, and the polynomials
Remind that
(
is a
-basis for
). We denote, by
, the auxiliary curves over
, defined, respectively, by the polynomials
,
, where
is the field of rational functions of the given surface.
Finally, let
where
returns the content of a polynomial
h w.r.t. some variable
x,
returns the primitive part of a polynomial
h with respect to a variable
x and
returns the resultant of two polynomials
and
w.r.t. some variable
x. Similarly, one also considers the polynomial
The computation of can be done in two different ways. First, we consider that the implicit equation defining the input surface is known. In this case, we carry out the arithmetic over while using this implicit equation. We observe that, since ( represents the ideal of ), the basic arithmetic on can be carried out by computing polynomial remainders. Thus, we conclude that the quotient field is computable. Furthermore, we note that we calculate the resultants of polynomials in , which is a unique factorization domain, and we compute gcds of univariate polynomials over and, thus, in an Euclidean domain. In the second way, we avoid the requirement on the implicit equation. More precisely, the elements are represented (not uniquely) as function of polynomials in the variables . We check the zero equality while using the input rational parametrization. This way could be too time consuming. In order to avoid this problem, one may test zero–equality by substituting a random point on the surface. The result of this test is correct with probability almost one. Additionally, one may also test the correctness of the computation of the inverse by checking it on a randomly chosen point on the given surface. In this way, we avoid the computation of the implicit polynomial.
In the following theorem, we provide the technique for computing the components of the inverse of a given rational proper parametrization . Additionally, we characterize the properness of . We illustrate this result in Example 1.
Theorem 3. The rational parametrization is proper if and only if for a generic point on the surface, it holds that . In this case, the -coordinate of the inverse of is given by solving w.r.t the variable .
Proof. Using the results shown in [
43] (see Proposition 1), we deduce that the non-constant
-coordinates of the intersections points in
are given by the roots of the polynomial
. Thus, we only have to prove that
is proper if and only there exists one unique point
(
K denotes the algebraic closure of the field
; i.e
). Indeed: first, let
be the inverse of the rational proper parametrization
. Subsequently,
and, thus,
, which implies that
In addition, since
M is the inverse of
, one has that
. Hence,
. Now, let us see that
M is unique. Let
The equalities
imply that
Afterwards, by the properties of resultants and by Lemma 1, we get that
and since
is proper we deduce that
. Thus, left composing by
, we get that
.
Reciprocally, because there exists a unique point in , A is fixed under the action of the Galois group and, thus, . Reasoning similarly, as we did for the uniqueness in the above implication, one gets that and, then, we conclude that A is the inverse of . □
Remark 1. Theorem 3 can be stated similarly for . More precisely, is proper if and only if, for a generic point on the surface, it holds that . In this case, the -coordinate of the inverse of is given by solving w.r.t the variable .
We also note that we may work over the affine space (i.e., ) and the obtained results are the same, but over the affine space. If , then the computations are more efficient.
Example 1. Let be the rational surface that is defined by the parametrizationFirst, we compute the polynomialswhere the μ-basis is given asNow, we determine and . We obtainBecause , we conclude that is proper and the first coordinate of the inverse is given asReasoning similarly with , we obtain the second coordinate of the inverse, which is given as Based upon the above theorem, we may compute
for a generic point
Q and, thus, to obtain the degree of the rational map induced by
. For this purpose, we consider
, where
are new variables, and the polynomials
where
Remind that ( is a -basis for ). We denote, by , the auxiliary curves over defined, respectively, by the polynomials , Thus, one obtains the following proposition.
Theorem 4. For a generic point , it holds that Proof. First, we use Proposition 1 in [
43], and we deduce that the non-constant
-coordinates of the intersections points in
are given by the roots of the polynomial
. Thus, we only have to prove that
if and only if
, where
is the algebraic closure of the field. Indeed, if
thus
, which implies that
Because
, we get that
with
(since
), which implies that
. Hence,
.
Reciprocally, let
. Subsequently,
which implies that
with
. Because
we get that
Thus,
and, hence,
Furthermore, since
, we also get that
. □
Clearly, Theorem 4 can be also stated for a generic point
on the surface, and the polynomials
(remind that
(
). For this purpose, one considers the polynomials
and
where computation can be done, as we described in the paragraph before Theorem 3, i.e., over the field of rational functions
. Thus, one has the following corollary.
Corollary 1. For a generic point , it holds that Remark 2. From the proof of Theorem 4, we deduce that .
Example 2. Let be the rational surface that is defined by the parametrizationWe determine the polynomials , , , where the μ-basis is given byNow, we determine (similarly, if we compute ), and we obtainTherefore, applying Theorem 4, we conclude that is not proper and in fact . Furthermore, 4. On the Problem of the Reparametrization Using -Basis
In this section, we consider the problem of computing a rational proper reparametrization of a given algebraic surface defined by an improper parametrization. That is,
given an algebraically closed field , and , a rational parametrization of a surface over , we want to compute a proper parametrization of , , and such thatNotice that we consider , with , in homogenous form, i.e., means that , which is a polynomial vector in homogenous form.
In this section, although we do not provide a solution to the general reparametrization problem, we show how the
-basis can be used to provide some information concerning
We address the problem partially and the idea presented is based in the results in [
32], but we trust that we could develop deeply these new approaches in future works, and more results concerning this topic allow us to get more advances.
The approach that is presented in this section is based on the computation of polynomial gcds and univariate resultants. These techniques always work and the time performance is very effective. The algorithm presented follows directly from the algorithm that was developed in [
39], which solves the problem for the case of curves. Accordingly, we first outline this approach and illustrate it with an example.
Example 3. Let be the rational curve that is defined by the parametrizationIn Step 2 of the algorithm, we determine the polynomials and , where the μ-basis is Now, we compute ,where , , and . Because , we go to Step 5 of Algorithm 1, and we considerNote that . Now, we determine the polynomialsFinally, the algorithm outputs the proper parametrization , and the rational function (see Step 7) Algorithm 1 Proper Reparametrization for Curves using -Basis |
Input a rational parametrization of a plane algebraic curve . Output a rational proper parametrization of , and a rational function such that . Steps - 1.
Compute a -basis of Let be this -basis. - 2.
Compute . - 3.
Compute Let . - 4.
If , return , and . Otherwise go to Step 5. - 5.
Consider such that are not associated polynomials (i.e., ). - 6.
- 7.
Return or the equivalent projective parametrization , and .
|
The main idea of the result that we develop in this paper consists in computing a reparametrization of two auxiliary parametrizations (defining two space curves), and , directly defined from a given rational parametrization of the surface (see Definition 2). Moreover, using that the degree of a rational map is multiplicative under composition, we get some results that relate the degree of the rational map that is induced by with the degree of , and the degree of the rational maps induced by and . In addition, we also prove the relation with the degree w.r.t. the variables of .
To start with, we first provide the following lemma that analyzes the behavior of the -basis under reparametrizations.
Lemma 1. Let , and be a μ-basis for a parametrization of a surface . Let . Subsequently, , , is a μ-basis for the reparametrization .
Proof. Taking into account that , and is a -basis for , from Theorem 1, it follows that for some non-zero constant k. Therefore, we easily get that for some non-zero constant k. Hence, from Theorem 1, we conclude that , , is a -basis for . □
In the next proposition, we assume that we know , and and , and we present a method for computing , and from , and , respectively. We state Proposition 1 for and . One reasons, similarly, to obtain from and from .
We assume w.l.o.g that
m which implies that
(otherwise, we consider another non-zero component of
). Thus, we may write
Let us assume that
(otherwise, we simplify these rational functions). In addition, we note that, if
, then we easily get that
. For the case of
, we consider
that can be seen as an affine parametrization of the surface defined by the irreducible polynomial
(note that
and
). Hence, we only have to compute the implicit equation of that surface by applying, for instance, the method that is presented in [
44].
Reasoning, similarly, can be seen as a parametrization of the surface defined by the irreducible polynomial , for . Summarizing, we have the following proposition.
Proposition 1. Under the conditions that are stated above, it holds that the implicit equation of the parametrization is given as , for .
In Remark 3, we apply the same idea that is stated in Proposition 1, but for the particular case of curves.
Given a rational projective parametrization of a surface over K, in Definition 2 we introduce some auxiliary parametrizations over that are defined from .
Definition 2. Let be a parametrization with coefficients in K. We define thepartial parametrizations associated to as the parametrizations with coefficients in (i.e., is defined over ), for and .
We note that the partial parametrization () determines a space curve in , where is the algebraic closure of . In addition, we note that Definition 2 can also be stated for any . That is, given , one may consider (i.e., N is seen defined over and in the variable ), for and . Similarly, one also may adapt Definition 2 for any polynomial .
The properness of the input parametrization
of a surface
can be characterized by means of the properness of its partial parametrizations. In particular, it is proved that
is birational if and only if its associated partial parametrizations,
, are proper and
, where
(see [
32]).
In the following, given a rational affine parametrization of a surface , we develop an algorithm that computes a rational parametrization of , and , such that . The algorithm is based on the computation of polynomial gcds and univariate resultants whose computing time performance is very satisfactory.
We prove that the partial parametrizations that correspond to the output parametrization,
, are proper (see Theorem 5), and we get properties relating the degree of
with the degree of the rational map
, and the degree of
(see Theorem 6). More precisely, we prove that
where
In Corollaries 2 and 3, we analyze in which conditions or, otherwise, the degree of the rational map induced by is lower than the degree that is induced by the input parametrization .
In Theorem 5, we have that the partial parametrizations associated to the output parametrization,
, are proper (see [
32]) but we can not ensure that
is proper.
Theorem 5. The partial parametrizations and associated to the parametrization computed by Algorithm 2 are proper.
Algorithm 2 Proper Reparametrization for Surfaces using -Basis |
Input a rational parametrization of an algebraic surface . Output a rational parametrization of , and such that . Steps - 1.
Compute a -basis of Let be this -basis. - 2.
Apply Algorithm 1 to . If is not proper, then the algorithm returns the proper parametrization , and ( seen with coefficients in ), such that . Otherwise, the algorithm returns (i.e , and ). - 3.
Apply Algorithm 1 to . If is not proper, the algorithm returns the proper parametrization , and ( seen with coefficients in ) such that . Otherwise, the algorithm returns (i.e , and ). Then,
- 4.
Return the rational parametrization of the surface , and
|
From Algorithm 2, and while using that the degree of a rational map is multiplicative under composition, we deduce some properties that relate the degree the rational map
with the degree of the rational maps
,
,
, and with
, where
. One reasons, similarly as in [
32].
Corollary 2. The following statements are equivalent:
- (1)
is proper.
- (2)
.
- (3)
.
Finally, in Corollary 3, we show in which conditions Algorithm 2 does not return a better reparametrization than the input one (in the sense of the degree of the rational map that is induced by the rational parametrization).
Corollary 3. It holds that if and only if In particular, if for , then .
We observe that, while using previous results, one may easily analyze whether some families of surfaces can be properly reparametrized using the approach presented in this paper. For instance, if for some , and , where n is a prime number, then .
To finish this section, we illustrate Algorithm 2 with one example. The times of our implementation performance is similar to the times that were obtained in [
32].
Example 4. Let be the rational surface that is defined by the parametrizationFor this purpose, in Step 1 of Algorithm 2, we compute a μ-basis of and we get that is given by Using Theorem 4, one gets that . Now, we apply Algorithm 1 to . We obtain thatand (remind that is seen as a polynomial in the variable and with coefficients in ). Subsequently, we determine the polynomialsfor . We obtain thatNow, in Step 3 of the algorithm, we apply Algorithm 1 to . For this purpose, we first compute a μ-basis of and we get that it is given by (see Remark 3) We obtain thatthat is, is not proper. Afterwards, we compute , and the polynomialsfor (remind that is seen as a polynomial in the variable and with coefficients in ). We obtain thatIn Step 4, the algorithm returns the parametrization and We observe thatThus, since , by Theorem 6, we conclude that and, hence, is proper. Remark 3. Using Lemma 1, we may compute a μ-basis, , of from the μ-basis, , of . Remind that , and is seen as a polynomial in the variable with coefficients in . Thus, we have a particular case (case of curves) of the reasoning that is presented in Proposition 1 (which is stated for surfaces). More precisely, we write and . Observe that the implicit equation of the parametrization (seen with coefficients in and in the variable ) is given by the polynomial for (i.e., the coefficients of the the implicit equation are in ). In order to compute this implicit equation, we may use that (see, e.g., [44]). Similarly one reasons to get from and from . Observe that this is a particular case of the result presented in Proposition 1 (we apply the same idea stated in Proposition 1, but for the particular case of curves). 5. Implicitization Using -Basis
In the following, we assume that we are in the affine space (i.e.,
; this simplifies the time on the computations), and we consider the polynomials
Note that, then, we may write
In addition, let
Finally,
denotes the fiber of a point
, where
and
is the
-projection of
. That is
where
.
Proof. Because
is a
-basis of
, we have
Consider a generic point
on the variety generated by
and the associated polynomials
where
, and
. It holds that
. In fact,
is derived by eliminating
from the first and third equations in (
1). Similarly, to find
from the last two equations in (
1).
Thus, one may reason as in Theorem 4 and Corollary 1 (also see Remark 2) to get that
(remind that
). □
Theorem 7. Let , and a μ-basis for . It holds thatwhereand Proof. Let
be this quantity. Clearly,
. In addition, let
and
. Regarding
and
as polynomials in
, and using that the resultant of two univariate polynomials is the product of the evaluations of one of them in the roots of the other, we get
where
A is the leading coefficient of
w.r.t.
, and where
are the roots of
in the algebraic closure
of
(we regard
as an univariate polynomial in
). Similarly,
where
B is the leading coefficient of
w.r.t.
, and
are the roots of
in
(we regard
as a univariate polynomial in
). Therefore,
By Lemma 2, there exist
pairs of points
being in
, and for each
it holds that
. Thus,
where
Note that for each root there exists a unique satisfying that the pair is in the fiber. Furthermore, for , either or (see Lemma 2). Hence, depends on Z or W. In addition, each does depend on Z or W.
Next, we show that
, regarded as polynomial in
, is primitive w.r.t. the variables
. For this purpose, we denote, by
, the content of
Q w.r.t.
. Thus, there exists
satisfying that the polynomial
N divides
; that is,
divides
and, then,
divides
and
. Taking into account that at least one of them is not zero, we get that
and, thus,
Q is primitive w.r.t.
. Now, using that
we obtain that
where
. Thus,
Under these conditions, it holds that Indeed, clearly one has . If , thus, there exists , such that . Moreover, , which is impossible since .
Now, we prove that
Indeed, clearly one has that
Furthermore,
, since
for
(observe that
). Thus, since
(see [
44]) and
, we get that
, which implies that
and, hence,
. Because
, we conclude that
and
. □
In the following examples, we illustrate the above theorem. These examples are taken from [
5].
Example 5. Let be the rational surface that is defined by the parametrization We determine the polynomials , , , where the μ-basis is given by
Now, we determineand we compute ,
.
and
Observe that we may conclude that and, thus, is a proper rational parametrization.
We have implemented this method while using Maple 2016 on a Lenovo ThinkPad Intel(R) Core(TM) i7-7500U CPU @ GHz GHz and 16 GB of RAM, OS-Windows 10 Pro. The time, in CPU seconds, for this example is and using Gröbner basis, we get .
Example 6. Let be the rational surface defined by the parametrization
We determine the polynomials , , , where the μ-basis is given by
Now, we determineand we compute and . Additionally, letandFinally, we computeand from , we get that -4.6cm0cm
and . That is, is a proper rational parametrization.
The time, in CPU seconds, for this example is , and using Gröbner basis, we get a time that is .
Remark 4. In order to improve the time of computations, one may compute the polynomialas , whereand are random constants. The answer is correct with a probability of almost one, since, taking into account the behavior of the gcd under specializations, this property holds in an open Zariski subset (see e.g., Lemmas 7 and 8 in [45]).