Related papers: Discrete extrinsic curvatures based on polar polyh…
In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. In this survey we discuss the following two fundamental Discretization Principles: the…
The medial axis $M_X$ of a closed set $X\subset \mathbb{R}^n$ is the set of points from the ambient space that admit more than one closest point in $X$. We study the problem of reaching the singularities, i.e. of characterising the points…
The method for approximation of planar curve by circular arcs with length preservation, proposed by I.Kh. Sabitov and A.V. Slovesnov, is analyzed. We extend the applicability of the method, and consider some corollaries, not related to the…
We present a PDE-based approach for the multidimensional extrapolation of smooth scalar quantities across interfaces with kinks and regions of high curvature. Unlike the commonly used method of [2] in which normal derivatives are…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…
We propose a notion of distance between two parametrized planar curves, called their discrepancy, and defined intuitively as the minimal amount of deformation needed to deform the source curve into the target curve. A precise definition of…
We study the error calculus from a mathematical point of view, in particular for the infinite dimensional models met in stochastic analysis. Gauss was the first to propose an error calculus. It can be reinforced by an extension principle…
In this work, following the discrete de Rham (DDR) approach, we develop a discrete counterpart of a two-dimensional de Rham complex with enhanced regularity. The proposed construction supports general polygonal meshes and arbitrary…
This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…
We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…
This paper presents a mathematical analysis of an elliptic partial differential equation (PDE) designed to compute the geometric thickness of a given shape. The PDE-based formulation provides a direct and systematic approach to evaluate…
We consider discrete best approximation problems in the setting of tropical algebra, which is concerned with the theory and application of algebraic systems with idempotent operations. Given a set of input--output pairs of an unknown…
A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a…
The Alexandrov-Fenchel inequality, a far-reaching generalization of the classical isoperimetric inequality to arbitrary mixed volumes, lies at the heart of convex geometry. The characterization of its extremal bodies is a long-standing open…
We present a nodal interpolation method to approximate a subdivision model. The main application is to model and represent curved geometry without gaps and preserving the required simulation intent. Accordingly, we devise the technique to…
The elliptic 2-Hessian equation is a fully nonlinear partial differential equation (PDE) that is related to intrinsic curvature for three dimensional manifolds. We introduce two numerical methods for this PDE: the first is provably…
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…
Given a triangulated surface, a polyhedral metric could be constructed by gluing Euclidean triangles edge-to-edge. We carefully describe the construction and prove that such a polyhedral metric is the only intrinsic metric on the glued…