相关论文: Numerical Calculation of a Minimal Surface Using B…
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…
There are very few mathematical results governing the interpolation of functions or their gradients on Delaunay meshes in more than two dimensions. Unfortunately, the standard techniques for proving optimal interpolation properties are…
This paper describes a method for fast simplification of surface meshes. Whereas past methods focus on visual appearance, our goal is to solve equations on the surface. Hence, rather than approximate the extrinsic geometry, we construct a…
Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required…
Several problems of trigonometric approximation on a hexagon and a triangle are studied using the discrete Fourier transform and orthogonal polynomials of two variables. A discrete Fourier analysis on the regular hexagon is developed in…
For a line arrangement in the complex projective plane $\mathbb{P}^2$, we investigate the compactification $\overline{F}$ of the affine Milnor fiber in $\mathbb{P}^3$ and its minimal resolution $\widetilde{F}$. We compute the Chern numbers…
We give a description of the minimal exponent of a hypersurface using higher direct images of suitably twisted sheaves of log forms on a log resolution.
It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…
Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling, as developed in \cite{LSX}. The main results consist of a new derivation of the Gaussian type cubature for the…
The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…
Previous works show convergence of rational Chebyshev approximants to the Pad\'e approximant as the underlying domain of approximation shrinks to the origin. In the present work, the asymptotic error and interpolation properties of rational…
We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…
We present a new image scaling method both for downscaling and upscaling, running with any scale factor or desired size. The resized image is achieved by sampling a bivariate polynomial which globally interpolates the data at the new scale.…
This paper applies a complete parametric set for approximating the geometry of a quadrilateral element. The approximation basis used is a complete Pascal polynomial of second order with six free parameters. The interpolation procedure is a…
Let $V$ be a smooth quasi-projective complex surface with compactification $(X,D)$ and set $\overline P_1(V):=h^0(X,K_X+D)$, $\overline q(V):=h^0(X,\Omega^1_X(\log D))$. We prove that $\overline P_1(V)\ge \overline q(V)-1$ if $V$ has…
In this paper we study an extension of the Bernstein Theorem for minimal spacelike surfaces of the four dimensional Minkowski vector space form and we obtain the class of those surfaces which are also graphics and have non-zero Gauss…
Let $ M^n$ be a closed immersed minimal hypersurface in the unit sphere $\mathbb{S}^{n+1}$. We establish a special isoperimetric inequality of $M^n$. As an application, if the scalar curvature of $ M^n$ is constant, then we get a uniform…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
A method for computing global minima of real multivariate polynomials based on semidefinite programming was developed by N. Z. Shor, J. B. Lasserre and P. A. Parrilo. The aim of this article is to extend a variant of their method to…
Generalising the two-dimensional case, we provide estimates for the mean-values of the lengths of the edges of an integral box with given volume and minimal surface.