Related papers: Discrete Affine Minimal Surfaces with Indefinite M…
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…
This work presents uniform preconditioners for the discrete Laplace--Beltrami operator on hypersurfaces. In particular, within the framework of fast auxiliary space preconditioning (FASP), we develop efficient and user-friendly multilevel…
We consider the extrinsic geometry of surfaces in simply isotropic space, a three-dimensional space equipped with a rank 2 metric of index zero. Since the metric is degenerate, a surface normal cannot be unequivocally defined based on…
Unsigned Distance Functions (UDFs) can be used to represent non-watertight surfaces in a deep learning framework. However, UDFs tend to be brittle and difficult to learn, in part because the surface is located exactly where the UDF is…
We present a general purpose method for solving partial differential equations on a closed surface, based on a technique for discretizing the surface introduced by Wenjun Ying and Wei-Cheng Wang [J. Comput. Phys. 252 (2013), pp. 606-624]…
We exhibit a smooth complex rational affine surface with uncountably many nonisomorphic real forms.
We provide a simple unified approach to obtain (i) Discrete polygonal isoperimetric type inequalities of arbitrary high order. (ii) Arbitrary high order isoperimetric type inequalities for smooth curves, where both upper and lower bounds…
We define a new category of non-archimedean analytic spaces over a complete discretely valued field, which we call uniformly rigid. It extends the category of rigid spaces, and it can be described in terms of bounded functions on products…
We develop a general framework for construction and analysis of discrete extension operators with application to unfitted finite element approximation of partial differential equations. In unfitted methods so called cut elements intersected…
We propose to imagine that every Riemannian metric on a surface is discrete at the small scale, made of curves called walls. The length of a curve is its number of wall crossings, and the area of the surface is the number of crossings of…
We introduce floating bodies for convex, not necessarily bounded subsets of $\mathbb{R}^n$. This allows us to define floating functions for convex and log concave functions and log concave measures. We establish the asymptotic behavior of…
Using the fact that any minimal strongly regular surface carries locally canonical principal parameters, we obtain a canonical representation of these surfaces, which makes more precise the Weierstrass representation in canonical principal…
In this paper higher order mimetic discretizations are introduced which are firmly rooted in the geometry in which the variables are defined. The paper shows how basic constructs in differential geometry have a discrete counterpart in…
Using Zeilberger generating function formula for the values of a discrete analytic function in a quadrant we make connections with the theory of structured reproducing kernel spaces, structured matrices and a generalized moment problem. An…
Since the classification of discrete Painlev\'e equations in terms of rational surfaces, there has been much interest in the range of integrable equations arising from each of the 22 surface types in Sakai's list. For all but the most…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
We define a new theory of discrete Riemann surfaces and present its basic results. The key idea is to consider not only a cellular decomposition of a surface, but the union with its dual. Discrete holomorphy is defined by a straightforward…
In the case of finite measures on finite spaces, we state conditions under which {\phi}- projections are continuously differentiable. When the set on which one wishes to {\phi}- project is convex, we show that the required assumptions are…
We present a new mimetic finite difference method for diffusion problems that converges on grids with \textit{curved} (i.e., non-planar) faces. Crucially, it gives a symmetric discrete problem that uses only one discrete unknown per curved…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…