Related papers: Discrete extrinsic curvatures based on polar polyh…
We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…
Discrete conformal mappings based on circle packing, vertex scaling, and related structures has had significant activity since Thurston proposed circle packing as a way to approximate conformal maps in the 1980s. The first convergence…
The inhomogeneous Groshev type theory for dual Diophantine approximation on manifolds is developed. In particular, the notion of nice manifolds is introduced and the divergence part of the theory is established for all such manifolds. Our…
After characterizing the integrable discrete analogue of the Euler's elastica, we focus our attention on the problem of approximating a given discrete planar curve by an appropriate discrete Euler's elastica. We carry out the fairing…
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…
Convex clustering has recently garnered increasing interest due to its attractive theoretical and computational properties, but its merits become limited in the face of high-dimensional data. In such settings, pairwise affinity terms that…
Confocal quadrics capture (encode) and geometrize spectral properties of symmetric operators. Certain metric-projective properties of confocal quadrics (most of them established in the first half of the XIX$^{\mathrm{th}}$ century) {\it…
Complex signed measures of finite total variation are a powerful signal model in many applications. Restricting to the $d$-dimensional torus, finitely supported measures allow for exact recovery if the trigonometric moments up to some order…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
This paper uses the Modified Projection Method to examine the errors in solving the boundary integral equation from Laplace equation. The analysis uses weighted norms, and parallel algorithms help solve the independent linear systems. By…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a…
Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…
The early Renaissance artist Albrecht Durer published a book on geometry a few years before he died. This was intended to be a guide for young craftsmen and artists giving them both practical and mathematical tools for their trade. In the…
We study the Discrete Gauss Image Problem, a generalization of Aleksandrov's classical question on the existence of convex bodies with prescribed integral curvature. We introduce a combinatorial problem called the Assignment Problem and…
A novel algorithm is proposed for quantitative comparisons between compact surfaces embedded in the three-dimensional Euclidian space. The key idea is to identify those objects with the associated surface measures and compute a weak…
The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and…
We introduce optimal quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. Using the homotopy continuation concept [6] that transforms optimal quadrature rules from…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
By the Riemann-mapping theorem, one can bijectively map the interior of an $n$-gon $P$ to that of another $n$-gon $Q$ conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of $P$ to those $Q$.…