Related papers: From affine to barycentric coordinates in polytope…
Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…
We construct several stable finite element pairs for the Stokes problem on barycentric refinements in arbitrary dimensions. A key feature of the spaces is that the divergence maps the discrete velocity space onto the the discrete pressure…
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…
We quantify conditions that ensure that a signed measure on a Riemannian manifold has a well defined centre of mass. We then use this result to quantify the extent of a neighbourhood on which the Riemannian barycentric coordinates of a set…
We introduce the notion centre of a convex set and study the space of continuous affine functions on a compact convex set with a centre. We show that these spaces are precisely the dual of a base normed space in which the underlying base…
In this paper, the concept of the metric matrix is introduced to establish a concise and unified formulation for the inner product in barycentric coordinates. Building on this framework, we explore the intrinsic algebraic identities of…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
The gradient bounds of generalized barycentric coordinates play an essential role in the $H^1$ norm approximation error estimate of generalized barycentric interpolations. Similarly, the $H^k$ norm, $k>1$, estimate needs upper bounds of…
In this paper, we introduce new generalized barycentric coordinates (coined as {\em moment coordinates}) on nonconvex quadrilaterals and convex hexahedra with planar faces. This work draws on recent advances in constructing interpolants to…
Spherical and polar geometries arise in many important areas of computational science, including weather and climate forecasting, optics, and astrophysics. In these applications, tensor-product grids are often used to represent unknowns.…
This paper generalizes the result of Elmachtoub et al to any weighted barycenter, where a transformation is considered which takes an arbitrary point of division $\xi \in (0,1)$ of the segments of a polygon with $n$ vertices. We then…
Counting lattice points within a rational polytope is a foundational problem with applications across mathematics and computer science. A key approach is Barvinok's algorithm, which decomposes the lattice point generating function of cones…
Barycentric algebras are an abstraction of the notion of convex sets, defined by a set of equations. We study semitopological and topological barycentric algebras, in the spirit of a previous study by Klaus Keimel on semitopological and…
This work derives a posteriori error estimate of polygonal finite element methods based on Wachspress barycentric coordinates. In particular, we prove that the classical residual-based a posteriori error estimator is both an upper and lower…
Barycentric averaging is a principled way of summarizing populations of measures. Existing algorithms for estimating barycenters typically parametrize them as weighted sums of Diracs and optimize their weights and/or locations. However,…
The farthest point map sends a point in a compact metric space to the set of points farthest from it. We focus on the case when this metric space is a convex centrally symmetric polyhedron, so that we can compose the farthest point map with…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
We give a short and simple proof of a recent result of Dobbins that any point in an $nd$-polytope is the barycenter of $n$ points in the $d$-skeleton. This new proof builds on the constraint method that we recently introduced to prove…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…