Related papers: Approximate implicitization using linear algebra
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
We discuss how Dokken's methods of approximate implicitization can be applied to triangular B\'ezier surfaces in both the original and weak forms. The matrices $\mathbf{D}$ and $\mathbf{M}$ that are fundamental to the respective forms of…
We unveil in concrete terms the general machinery of the syzygy-based algorithms for the implicitization of rational surfaces in terms of the monomials in the polynomials defining the parametrization, following and expanding our joint…
The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pad\'e approximation, sometimes accompanied by the Schur decomposition. The main computational…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
We propose a general framework for geometric approximation of circular arcs by parametric polynomial curves. The approach is based on constrained uniform approximation of an error function by scalar polynomials. The system of nonlinear…
We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…
It is still a challenging task of today to recognize the type of a given algebraic surface which is described only by its implicit representation. In~this paper we will investigate in more detail the case of canal surfaces that are often…
The advancements in neural rendering have increased the need for techniques that enable intuitive editing of 3D objects represented as neural implicit surfaces. This paper introduces a novel neural algorithm for parameterizing neural…
CUR and low-rank approximations are among most fundamental subjects of numerical linear algebra, with a wide range of applications to a variety of highly important areas of modern computing, which range from the machine learning theory and…
A parameterized surface can be represented as a projection from a certain toric surface. This generalizes the classical homogeneous and bihomogeneous parameterizations. We extend to the toric case two methods for computing the implicit…
Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…