Related papers: Computing the symmetries of a ruled rational surfa…
We show that a real rational (over $\C$) surfaces are quasi-simple, i.e., that such a surface is determined up to deformation in the class of real surfaces by the topological type of its real structure.
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
We present a computational scheme that derives a global polynomial level set parametrisation for smooth closed surfaces from a regular surface-point set and prove its uniqueness. This enables us to approximate a broad class of smooth…
We propose a novel numerical approach to compute the Pareto front in multivariate polynomial multi-objective optimization problems. When the objective functions and (equality) constraints are multivariate polynomials, the Pareto front,…
We describe smooth rational projective algebraic surfaces over an algebraically closed field of characteristic different from 2 which contain $n \ge \b_2-2$ disjoint smooth rational curves with self-intersection -2, where $\b_2$ is the…
The generalized winding number is an essential part of the geometry processing toolkit, allowing to quantify how much a given point is inside a surface, even when the surface has boundaries and noise. We propose a new universal method to…
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…
Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several…
We present an approach to finding the implicit equation of a planar rational parametric cubic curve, by defining a new basis for the representation. The basis, which contains only four cubic bivariate polynomials, is defined in terms of the…
The paper motivates high dimensional smoothing with penalized splines and its numerical calculation in an efficient way. If smoothing is carried out over three or more covariates the classical tensor product spline bases explode in their…
Randomly sampling points on surfaces is an essential operation in geometry processing. This sampling is computationally straightforward on explicit meshes, but it is much more difficult on other shape representations, such as widely-used…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…
We provide algorithms to reconstruct rational ruled surfaces in three-dimensional projective space from the `apparent contour' of a single projection to the projective plane. We deal with the case of tangent developables and of general…
We study rationality problems for smooth complete intersections of two quadrics. We focus on the three-dimensional case, with a view toward understanding the invariants governing the rationality of a geometrically rational threefold over a…
We give a new method for the evaluation of a class of integrals of rational symmetric functions in N pairs of variables {x_a, y_a}_{a=1,... N} arising in coupled matrix models, valid for a broad class of two-variable measures. The result is…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…