Related papers: Discrete extrinsic curvatures based on polar polyh…
The determination of the gravitational potential by the polyhedral method is revisited in the case where the surface of a body is composed of triangular facets. Based upon six test-shapes of astrophysical interest (sphere, spheroid,…
We design in this work a discrete de Rham complex on manifolds. This complex, written in the framework of exterior calculus, has the same cohomology as the continuous de Rham complex, is of arbitrary order of accuracy and, in principle, can…
We propose a novel second-order ODE as the continuous-time limit of a Riemannian accelerated gradient-based method on a manifold with curvature bounded from below. This ODE can be seen as a generalization of the ODE derived for Euclidean…
In this paper, we revisit the notion of length measures associated to planar closed curves. These are a special case of area measures of hypersurfaces which were introduced early on in the field of convex geometry. The length measure of a…
A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon…
The mean curvature flow describes the evolution of a surface (a curve) with normal velocity proportional to the local mean curvature. It has many applications in mathematics, science and engineering. In this paper, we develop a numerical…
We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate…
A discretisation scheme that preserves topological features of a physical problem is extended so that differential geometric structures can be approximated in a consistent way thus giving access to the study of physical systems which are…
We propose a computation of curvature of arbitrary two-dimensional surfaces of three-dimensional objects, which is a contribution to discrete gravity with potential applications in network geometry. We begin by linking each point of the…
In recent papers the author introduced a simple alternative to isoparametric finite elements of the n-simplex type, to enhance the accuracy of approximations of second-order boundary value problems with Dirichlet conditions, posed in smooth…
In his treatise addressed to Dositheus of Pelusium, Archimedes of Syracuse obtained the result of which he was the most proud: a sphere has two-thirds the volume of its circumscribing cylinder. At his request a sculpted sphere and cylinder…
This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
This paper is concerned with applications of the theory of approximation and interpolation based on compensated convex transforms developed in [K. Zhang, E. Crooks, A. Orlando, Compensated convexity methods for approximations and…
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
Thurston's circle packing approximation of the Riemann Mapping (proven to give the Riemann Mapping in the limit by Rodin-Sullivan) is largely based on the theorem that any topological disk with a circle packing metric can be deformed into a…
We show how to define curvature as a measure using the Gauss-Bonnet Theorem on a family of singular surfaces obtained by gluing together smooth surfaces along boundary curves. We find an explicit formula for the curvature measure as a sum…
In this work, following the Discrete de Rham (DDR) paradigm, we develop an arbitrary-order discrete divdiv complex on general polyhedral meshes. The construction rests 1) on discrete spaces that are spanned by vectors of polynomials whose…
We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are…