Matrix representations for toric parametrizations

In this paper we show that a surface in P^3 parametrized over a 2-dimensional toric variety T can be represented by a matrix of linear syzygies if the base points are finite in number and form locally a complete intersection. This constitutes a direct generalization of the corresponding result over P^2 established in [BJ03] and [BC05]. Exploiting the sparse structure of the parametrization, we obtain significantly smaller matrices than in the homogeneous case and the method becomes applicable to parametrizations for which it previously failed. We also treat the important case T = P^1 x P^1 in detail and give numerous examples.Comment: 20 page

Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces via Linear Syzygies

We show that the implicit equation of a surface in 3-dimensional projective space parametrized by bi-homogeneous polynomials of bi-degree (d,d), for a given positive integer d, can be represented and computed from the linear syzygies of its parametrization if the base points are isolated and form locally a complete intersection

Implicitization of curves and (hyper)surfaces using predicted support

We reduce implicitization of rational planar parametric curves and (hyper)surfaces to linear algebra, by interpolating the coefficients of the implicit equation. For predicting the implicit support, we focus on methods that exploit input and output structure in the sense of sparse (or toric) elimination theory, namely by computing the Newton polytope of the implicit polynomial, via sparse resultant theory. Our algorithm works even in the presence of base points but, in this case, the implicit equation shall be obtained as a factor of the produced polynomial. We implement our methods on Maple, and some on Matlab as well, and study their numerical stability and efficiency on several classes of curves and surfaces. We apply our approach to approximate implicitization, and quantify the accuracy of the approximate output, which turns out to be satisfactory on all tested examples; we also relate our measures to Hausdorff distance. In building a square or rectangular matrix, an important issue is (over)sampling the given curve or surface: we conclude that unitary complexes offer the best tradeoff between speed and accuracy when numerical methods are employed, namely SVD, whereas for exact kernel computation random integers is the method of choice. We compare our prototype to existing software and find that it is rather competitive

A survey of the representations of rational ruled surfaces

The rational ruled surface is a typical modeling surface in computer aided geometric design. A rational ruled surface may have different representations with respective advantages and disadvantages. In this paper, the authors revisit the representations of ruled surfaces including the parametric form, algebraic form, homogenous form and Pl¨ucker form. Moreover, the transformations between these representations are proposed such as parametrization for an algebraic form, implicitization for a parametric form, proper reparametrization of an improper one and standardized reparametrization for a general parametrization. Based on these transformation algorithms, one can give a complete interchange graph for the different representations of a rational ruled surface. For rational surfaces given in algebraic form or parametric form not in the standard form of ruled surfaces, the characterization methods are recalled to identify the ruled surfaces from them.Agencia Estatal de Investigació

Mini-Workshop: Surface Modeling and Syzygies

The problem of determining the implicit equation of the image of a rational map φ : P2 99K P3 is of theoretical interest in algebraic geometry, and of practical importance in geometric modeling. There are essentially three methods which can be applied to the problem: Gröbner bases, resultants, and syzygies. Elimination via Gröbner basis methods tends to be computationally intensive and, being a general tool, is not adapted to the geometry of specific problems. Thus, it is primarily the latter two techniques which are used in practice. This is an extremely active area of research where many different perspectives come into play. The mini-workshop brought together a diverse group of researchers with different areas of expertise

Computing the form of highest degree of the implicit equation of a rational surface

A method is presented for computing the form of highest degree of the implicit equation of a rational surface, defined by means of a rational parametrization. Determining the form of highest degree is useful to study the asymptotic behavior of the surface, to perform surface recognition, or to study symmetries of surfaces, among other applications. The method is efficient, and works generally better than known algorithms for implicitizing the whole surface, in the absence of base points blowing up to a curve at infinity. Possibilities to compute the form of highest degree of the implicit equation under the presence of such base points are also discussed. We provide timings to compare our method with known methods for computing the whole implicit equation of the surface, both in absence and in presence of base points blowing up to a curve at infinity.Agencia Estatal de Investigació

Computing the μ-bases of algebraic monoid curves and surfaces

The μ-basis is a developing algebraic tool to study the expressions of rational curves and surfaces. It can play a bridge role between the parametric forms and implicit forms and show some advantages in implicitization, inversion formulas and singularity computation. However, it is difficult and there are few works to compute the μ-basis from an implicit form. In this paper, we derive the explicit forms of μ-basis for implicit monoid curves and surfaces, including the conics and quadrics which are particular cases of these entities. Additionally, we also provide the explicit form of μ-basis for monoid curves and surfaces defined by any rational parametrization (not necessarily in standard proper form). Our technique is simply based on the linear coordinate transformation and standard forms of these curves and surfaces. As a practical application in numerical situation, if an exact multiple point can not be computed, we can consider the problem of computing “approximate μ-basis” as well as the error estimation.Agencia Estatal de Investigació

Implicitizing Rational Curves by the Method of Moving Algebraic Curves

AbstractA functionF(x,y,t)that assigns to each parametertan algebraic curveF(x,y,t)=0is called a moving curve. A moving curveF(x,y,t)is said to follow a rational curvex=x(t)/w(t),y=y(t)/w(t)ifF(x(t)/w(t), y(t)/w(t),t)is identically zero. A new technique for finding the implicit equation of a rational curve based on the notion of moving conics that follow the curve is investigated. For rational curves of degree 2nwith no base points the method of moving conics generates the implicit equation as the determinant of ann×nmatrix, where each entry is a quadratic polynomial inxandy, whereas standard resultant methods generate the implicit equation as the determinant of a 2n× 2nmatrix where each entry is a linear polynomial inxandy. Thus implicitization using moving conics yields more compact representations for the implicit equation than standard resultant techniques, and these compressed expressions may lead to faster evaluation algorithms. Moreover whereas resultants fail in the presence of base points, the method of moving conics actually simplifies, because when base points are present some of the moving conics reduce to moving lines