A new approach for surface intersection
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Efficient techniques for multipolynomial resultant algorithms
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Computations with parametric equations
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
Many current geometric modeling systems use the rational parametric form to represent surfaces. Although the parametric representation is useful for tracing, rendering and surface fitting, many operations like surface intersection desire one of the surfaces to be represented implicitly. Moreover, the implicit representation can be used for testing whether a point lies on the surface boundary and to represent an object as a semi-algebraic set. In the past, resultants and Grobner basis have been used to implicitize tensor product surfaces and triangular patches and in many cases the resulting expression consists of an extraneous factor. The separation of these extraneous factors can be a time consuming task involving multivariate factorization. Furthermore, these algorithms fail altogether if the given parameterization has base points. The parametrizations of many commonly used rational surfaces, like the quadrics and some cubics, have base points. In this paper we present an algorithm to implicitize parametric surfaces. If a parameterization has no base points, we formulate the parametric equations in such a manner that their resultant corresponds exactly to the implicit equation without generating any extraneous factor. We also analyze the problem of implicitization in the presence of base points. In particular, we perturb the given parametrizations and use resultants or Grobner basis of the perturbed system to compute the implicit representation. Our algorithm perturbs only one of the three equations and shows that the implicit equation is contained in the lowest degree term of the resultant of the perturbed equations (expressed in terms of the perturbing variable). The strength of the algorithm lies in the fact that it makes use of the GCD operation as opposed to multivariate factorization to extract the implicit equation out of the lowest degree term. The base points blow up to rational curves and the extraneous factors in the lowest degree term of