Geometric Information and Rational Parametrization of Nonsingular Cubic Blending Surfaces
Abstract
The techniques for parametrizing nonsingular cubic surfaces have shown to be of great interest in recent years. This paper is devoted to the rational parametrization of nonsingular cubic blending surfaces. We claim that these nonsingular cubic blending surfaces can be parametrized using the symbolic computation due to their excellent geometric properties. Especially for the specific forms of these surfaces, we conclude that they must be F3, F4, or F5 surfaces, and a criterion is given for deciding their surface types. Besides, using the algorithm proposed by Berry and Patterson in 2001, we obtain the uniform rational parametric representation of these specific forms. It should be emphasized that our results in this paper are invariant under any nonsingular real projective transform. Two explicit examples are presented at the end of this paper.
1. Introduction
Generating a rational parametric representation of an algebraic surface (called parametrization for short) is always difficult, even impossible sometimes, while the reverse process called implicitization is always solvable (such as using Gröbner basis method). Most of the parametrization algorithms for nonsingular cubic surfaces are based on geometric information of nonsingular cubic surfaces, such as the existence of 27 lines on nonsingular cubic surfaces [1]. In 1987, Sederberg and Snively parametrized cubic surfaces in terms of biquadratic polynomials using pairs of skew lines on the surfaces in [2]. This method is further developed by Bajaj et al. in [3] and Polo-Blanco and Top in [4]. In 2001, Berry and Patterson unified the implicitization and parametrization of a nonsingular cubic surface using Hilbert-Burch theorem in [5]. In 2007, Chen et al. presented an alternative method for parametrizing quadric and cubic surfaces based on the theory of μ-basis in [6].
- (i)
For the specific forms, we conclude that they must be F3, F4, or F5 surfaces, and present a criterion to decide their surface types. Besides, using the algorithm proposed in [5], we obtain their uniform rational parametric representation.
- (ii)
For the general forms, although they do not have the analogous concise properties as the specific forms do, we can still come to the conclusion that their rational parametrizations can be computed using the symbolic computation.
Additionally, it should be pointed out that our results in this paper are invariant under any nonsingular real projective transform.
The rest of the paper is organized as follows. Section 2 recalls some geometric information of nonsingular cubic surfaces and introduces the constructions for nonsingular cubic blending surfaces. Section 3 is devoted to the specific forms of nonsingular cubic blending surfaces, and we study in detail the geometric information on them and their uniform rational parametric representation. Section 4 discusses the analogous geometric properties of the general forms of nonsingular cubic blending surfaces as the specific forms. Two explicit examples are presented in Section 5. Finally, we conclude the paper in Section 6.
2. Notations and Preliminaries
For the convenience of applications, we always consider the problem in R[x1, x2, x3]. Let V(f) denote the algebraic surface determined by the polynomial equation f(x1, x2, x3) = 0. Assume that F is a set of polynomials, and denote by V(F) the set of solutions of the system of all polynomials in F. Let ćg, hć be the ideal generated by the polynomials g and h.
2.1. Geometric Information of Nonsingular Cubic Surfaces
In 1849, Cayley and Salmon published the famous theorem that there are 27 lines lying completely on a nonsingular cubic surface. Every line on a nonsingular cubic surface is met by ten others. A plane containing three of the lines is called a tritangent plane. There are 45 such planes on a nonsingular cubic surface. Nonsingular cubic surfaces can be divided into 5 species F1, F2, ā¦, F5 with respect to the number of real lines and real components. See Table 1 for more details.
Surface type | F1 | F2 | F3 | F4 | F5 |
---|---|---|---|---|---|
Number of real lines | 27 | 15 | 7 | 3 | 3 |
Number of real tritangent planes | 45 | 15 | 5 | 7 | 13 |
Number of real components | 1 | 1 | 1 | 1 | 2 |
Remark 2.1. Most of the parametrization algorithms lose effectiveness for F5 surfaces, since the F5 surfaces have no real one-to-one parametrization. Thus, we will not address nonsingular cubic blending surfaces of type F5 in this paper.
The computation of lines on a nonsingular cubic surface is our starting point for the analysis and parametrization of the surface, since we could know other geometric information of the surface from Table 1 once the number of real lines on the surface is verified.
Sederberg showed how to compute lines on a nonsingular cubic surface in [11]. Assume that we have a nonsingular cubic surface given by its implicit equation f(x1, x2, x3) = 0. The parametrization of a line with unknown coefficients is l(t): = (t, x20 + x21t, x30 + x31t). Substituting the parametric equation of the line into the implicit equation of the surface yields an equation f(l(t)) of degree 3 in the parameter t. If this equation is identically zero, that is, all the coefficients vanish simultaneously, it guarantees that the line lies entirely on the surface. In this way, the problem of finding a line on a nonsingular cubic surface is transformed into the problem of solving a system of four nonlinear equations in four unknowns. We can find at least one solution of this system using Grƶbner basis method or some other techniques.
If one line l(t) is known, we can use this line to find other lines on the surface. We take a pencil of planes through l(t) and intersect it with the surface. The intersection consists of l(t) and a residual conic š. The condition for š to degenerate into a pair of lines is that the determinant of its Hessian vanishes. The determinant of the Hessian of š is a polynomial of degree 5. Each of the 5 roots corresponds to a plane in which the residual intersection is degenerate. After computing the roots of this polynomial, it is possible to get other lines on the surface.
Remark 2.2. It is relatively expensive to compute one line on a nonsingular cubic surface. Besides, since quintic equations can only be solved numerically, not analytically, we could not obtain exact lines on the surface. However, nonsingular cubic blending surfaces in this paper just avoid these obstacles.
2.2. Nonsingular Cubic Blending Surfaces
In this subsection, we briefly introduce the constructions of nonsingular cubic blending surfaces. Suppose that we are given two quadratic surfaces V(g1), V(g2), and two associated clipping planes V(h1), V(h2). Without loss of generality, we assume that V(h1) and V(h2) intersect. Denote h3 = xi, where i ā {1,2, 3} such that V(h1, h2, h3) is an isolated point in R3.
Lemma 2.3 (see [12].)If the coefficients of g1 and g2 defined by (2.1) satisfy
- (i)
the nonsingular cubic surfaces V(f) defined by (2.3), which are constructed under the above general assumptions, are called the general forms,
- (ii)
if we add some extra restrictions to V(g1), V(g2), V(h1), and V(h2):
- (1)
let V(g1) and V(g2) be quadratic surfaces defined by
()where {j, k} = {1,2, 3}ā{i} and ri, xi0, ci, pi, and li are nonzero real numbers; - (2)
let V(h1) and V(h2) be associated clipping planes defined by
()where h10 and h20 are nonzero real numbers,
- (1)
then the nonsingular cubic surfaces V(f) defined by (2.3), which are constructed under this specific assumptions, are called the specific forms.
For these two classes of nonsingular cubic blending surfaces, our question is whether or not they have any good geometric property or any fast/exact parametrization algorithm.
3. Nonsingular Cubic Blending Surfaces: The Specific Forms
In this section, we mainly analyze some geometric information of the specific forms which is useful for the parametrization process and compute their uniform rational parametric representation.
3.1. Geometric Information
3.1.1. Lines on the Surfaces
According to the defining polynomial (2.3) and the results obtained in [13], we can easily find that V(h1, h2) is just one line on the surfaces.
Proposition 3.1. A1,Ī», ā¦, A4,Ī» in (3.1) satisfy that
- (1)
A1,Ī», A2,Ī», A3,Ī», A4,Ī» are polynomials of degree 1, 3, 2, 1 in Ī», respectively,
- (2)
A2,λ = (λ2 + 1)A1,λ,
- (3)
A1,Ī» and A4,Ī» differ by a nonzero constant.
3.1.2. A Classification of the Surfaces
Segre in [14] classifies nonsingular cubic surfaces using Table 2, according to the number of real roots of D(Ī») = 0 and whether or not the factorization of Q(h2, h3; Ī») in the corresponding tritangent plane is real or complex.
Surface type | F1 | F3 | F5 | F2 | F4 | F3 |
---|---|---|---|---|---|---|
Number of real roots of D(Ī») = 0 | 5 | 5 | 5 | 3 | 3 | 1 |
Number of real factorizations | 5 | 3 | 1 | 3 | 1 | 1 |
Using Table 2 and Proposition 3.1, we can arrive at the following theorem.
Theorem 3.2. The specific forms of nonsingular cubic blending surfaces must be F3, F4, or F5 surfaces.
Proof. Let Ī»1 be the root of A1,Ī» = 0. For all Ī» ā Rā{Ī»1}, we have
In what follows, we will give a complete solution for the surface type problem of the surfaces. The main tool we will use is the complete discrimination system for any polynomial with real coefficients proposed by Yang et al. in [15].
Lemma 3.3 (see [15].)Given a polynomial G(x) = a0xm + a1xmā1 + āÆ+am ā R[x], if the number of sign changes in the revised sign list with respect to G(x) is ν, then the number of pairs of the distinct conjugate imaginary roots of G(x) is ν. Moreover, if the number of nonvanishing members in the revised sign list with respect to G(x) is Ī·, then the number of the distinct real roots is Ī· ā 2ν.
Applying Lemma 3.3 to defined in (3.2) and according to Table 2 and Theorem 3.2, we can eventually arrive at the following proposition.
Proposition 3.4. The discriminant sequence [D1, D2, D3, D4] of is of the form
- (1)
If one of the following conditions holds:
()then the specific forms of nonsingular cubic blending surfaces are F3 surfaces. - (2)
If one of the following conditions holds:
()then the specific forms of nonsingular cubic blending surfaces are F4 surfaces. - (3)
If one of the following conditions holds:
()then the specific forms of nonsingular cubic blending surfaces are F5 surfaces.
3.2. The Uniform Rational Parametric Representation
Since our results of this subsection are based on the algorithm proposed by Berry and Patterson in [5], we first outline the strategy of their algorithm.
- (1)
Find a line l on the surface.
- (2)
Find a pair of complex conjugate tritangent planes through l, and denote them by m and m*.
- (3)
Compute the factorizations of the residual conic š (mentioned in Section 2.1) in m and m*, and denote them by m1 Ā· m2 and , respectively.
- (4)
Construct a 3 Ć 3 complex matrix of the form
()such that k is a complex number; p is a real plane; . - (5)
Find a real matrix U which is equivalent to and satisfies detā(U) = f.
- (6)
Compute the Hilbert-Burch matrix H from the equation
Now, using the notations and conclusions in Section 3.1, we apply the algorithm to the specific forms of type F3 and F4.
Proposition 3.5. p0, ā¦, p3, and k in are given by
Similarly, the uniform Hilbert-Burch matrix H can be constructed. We let Re(z) and Imā(z) denote the real part and the imaginary part of the complex number z, respectively.
Proposition 3.6. The uniform Hilbert-Burch matrix H is of the form
4. Nonsingular Cubic Blending Surfaces: The General Forms
In this section, we will see that for the general forms, their parametrizations can also be computed using the symbolic computation. However, their parametrizations are too complicated to be written down in a uniform form.
- (i)
V(h1, h2) is just one line on the surfaces,
- (ii)
the equation of the residual conic š is
()where() - (iii)
the determinant of the Hessian of Q(h2, h3; Ī») is
()where the second factor in the above product is some certain polynomial of degree 4 in Ī». Thus we can solve the equation D(Ī») = 0 analytically, - (iv)
at each root of D(Ī») = 0, we discuss the sign of the minor
()of (4.3). Then, we can determine the surface type and other geometric information using Table 2 and Table 1.
Because of the existence of the mixed term h3h2 in (4.1), the uniform representation of the factorization of (4.1) is very complicated, and so, we omit it. Finally, using the algorithm in [5], the rational parametrization of the general forms can be achieved without approximate calculation.
5. Example
Example 5.1. We are given a nonsingular cubic blending surface V(f) defined by the implicit equation
First, we let h3 = x3, and rewrite f(x1, x2, x3) = 0 in the following form:
Geometric Information V(h1, h2) is a line on V(f). The equation of the residual conic š is
Rational Parametrization We choose a pair of complex conjugate roots of D(Ī») = 0, I and āI. As mentioned in Section 3.2, we construct the complex matrix as
Example 5.2. We are given a nonsingular cubic blending surface V(f) defined by the implicit equation
Geometric Information V(h1, h2) is a line on V(f). The equation of the residual conic š is
Rational Parametrization We choose a pair of complex conjugate roots of D(Ī») = 0, and . We can construct the complex matrix as
6. Conclusions
This paper is concerned with nonsingular cubic blending surfaces. We mainly discuss geometric information and rational parametrization of them. Since their underlying geometric properties, the rational parametrization can be implemented using the symbolic computation, while for general nonsingular cubic surfaces, it has to resort to floating point numbers. In the future, we will focus on the analysis of singular cubic blending surfaces and nonsingular cubic blending surfaces of type F5.
Acknowledgments
The authors express their deep gratitude to the referee for useful suggestions and comments which have improved the paper. This work is partly supported by National Science Foundation of China (Grant no. 60973155).