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

Sparse implicitization by interpolation: Characterizing non-exactness and an application to computing discriminants

We revisit implicitization by interpolation in order to examine its properties in the context of sparse elimination theory. Based on the computation of a superset of the implicit support, implicitization is reduced to computing the nullspace of a numeric matrix. The approach is applicable to polynomial and rational parameterizations of curves and (hyper)surfaces of any dimension, including the case of parameterizations with base points. Our support prediction is based on sparse (or toric) resultant theory, in order to exploit the sparsity of the input and the output. Our method may yield a multiple of the implicit equation: we characterize and quantify this situation by relating the nullspace dimension to the predicted support and its geometry. In this case, we obtain more than one multiples of the implicit equation; the latter can be obtained via multivariate polynomial gcd (or factoring). All of the above techniques extend to the case of approximate computation, thus yielding a method of sparse approximate implicitization, which is important in tackling larger problems. We discuss our publicly available Maple implementation through several examples, including the benchmark of bicubic surface. For a novel application, we focus on computing the discriminant of a multivariate polynomial, which characterizes the existence of multiple roots and generalizes the resultant of a polynomial system. This yields an efficient, output-sensitive algorithm for computing the discriminant polynomial

Plane mixed discriminants and toric jacobians

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the existence of a multiple root. We concentrate on bivariate polynomials and establish an original formula that relates the mixed discriminant of two bivariate Laurent polynomials with fixed support, with the sparse resultant of these polynomials and their toric Jacobian. This allows us to obtain a new proof for the bidegree of the mixed discriminant as well as to establish multipicativity formulas arising when one polynomial can be factored.Comment: 16 page

Orbital carriers and inheritance in discrete-time quadratic dynamics

Explicit formulas for orbital carriers of periods 4, 5 and 6 are reported for discrete-time quadratic dynamics. A systematic investigation of orbital inheritance for periods as high as k <= 12 is also reported. Inheritance means that unknown orbits may be obtained by nonlinear transformations of known orbits. Such nested orbit within orbit stratification shows orbits not to be necessarily independent of each other as generally assumed. Orbital stratification is potentially significant to rearrange trajectories sums in trace formulas underlying modern semiclassical interpretations of atomic physics spectra. The stratification seems to dominate as the orbital period grows

Non-degenerate umbilics, the path formulation and gradient bifurcation problems

Parametrised contact-equivalence is successful for the understanding and classification of the qualitative local behaviour of bifurcation diagrams and their perturbations. Path formulation is an alternative point of view. It makes explicit the singular behaviour due to the core of the bifurcation germ (when the parameters vanish) from the effects of the way parameters enter. Here we show how path formulation can be used to classify and structure efficiently multiparameter bifurcation problems in corank 2 problems. In particular, the non degenerate umbilics singularities are the generic cores in four situations: the general or gradient problems and the Z_2-equivariant (general or gradient) problems where Z_2 acts on the second component of R^2 via the reflection kappa(x,y)=(x,-y). The universal unfolding of the umbilic singularities have an interesting 'Russian doll' type of structure of universal unfoldings in all those categories. In our approach we can handle one, or more, parameter situations using the same framework. We can even consider some special parameter structure (for instance some internal hierarchy). We classify the generic bifurcations with 1, 2 or 3 parameters that occur in those cases. Some results are known with one bifurcation parameter, but the others are new. We discuss some application to the bifurcation of a cylindrical panel under different loads structure. This problem has many natural parameters that provide concrete examples of our generic diagrams around the first interaction of the buckling modes