相关论文: Implicitization using approximation complexes

Chen, Sederberg, and Zheng introduced the notion of a $\mu$-basis for a rational ruled surface in Chen et al. (2001) and showed that its resultant is the implicit equation of the surface, if the parametrization is generically injective. We…

Mathematically representing the shape of an object is a key ingredient for solving inverse rendering problems. Explicit representations like meshes are efficient to render in a differentiable fashion but have difficulties handling topology…

This article presents an equivalent formulation of the implicit complementarity problem. We demonstrate that solution of the equivalent formulation is equivalent to the solution of the implicit complementarity problem. Moreover, we provide…

The complex method of interpolation, going back to Calder\'on and Coifman et al., on the one hand, and the Alexander-Wermer-Slodkowski theorem on polynomial hulls with convex fibers, on the other hand, are generalized to a method of…

In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…

Although implicit-explicit (IMEX) methods for approximating solutions to semilinear parabolic equations are relatively standard, most recent works examine the case of a fully discretized model. We show that by discretizing time only, one…

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…

Simplicial complexes form an important class of topological spaces that are frequently used in many application areas such as computer-aided design, computer graphics, and simulation. Representation learning on graphs, which are just 1-d…

In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…

We present a formalization of convex polyhedra in the proof assistant Coq. The cornerstone of our work is a complete implementation of the simplex method, together with the proof of its correctness and termination. This allows us to define…

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 an overview of some results about characterization of compactness in which the concept of approximation scheme has had a role. In particular, we present several results that were proved by the second author, jointly with Luther,…

It is shown that the complex field equipped with the "approximate exponential map", defined up to ambiguity from a small group, is quasiminimal: every automorphism-invariant subset of the field is countable or co-countable. If the ambiguity…

We consider the problem of approximation of a continuous function $f$ defined on a compact metric space $X$ by elements from a sum of two algebras. We prove a de la Vall\'{e}e Poussin type theorem, which estimates the approximation error…

Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…

We show that symplectic and linearly-implicit integrators proposed by [Zhang and Skeel, 1997] are variational linearizations of Newmark methods. When used in conjunction with penalty methods (i.e., methods that replace constraints by stiff…

Capture calculus has recently been proposed as a solution to effect checking, achieved by tracking the captured references of terms in the types. Boxes, along with the box and unbox operations, are a crucial construct in capture calculus,…

We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…

Numerical simulations of physical systems exhibit discrepancies arising from unmodeled physics and idealizations, as well as numerical approximation errors stemming from discretization and solver tolerances. This article reviews techniques…

We discuss possible discretizations of complex analysis and some of their applications to probability and mathematical physics, following our recent work with Dmitry Chelkak, Hugo Duminil-Copin and Cl\'ement Hongler.