Related papers: On spherical barycentric coordinates
We define discrete constant mean curvature (cmc) surfaces in the three-dimensional Euclidean and Lorentz spaces in terms of sphere packings with orthogonally intersecting circles. These discrete cmc surfaces can be constructed from…
We consider the spherical mean generated by a multidimensional generalized translation and general Euler-Poisson-Darboux equation corresponding to this mean. The Asgeirsson property of solutions of the ultrahyperbolic equation that includes…
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…
Spherical $t$-design is a finite subset on sphere such that, for any polynomial of degree at most $t$, the average value of the integral on sphere can be replaced by the average value at the finite subset. It is well-known that an…
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…
This paper aims at developing new shape functions adapted to smooth vanishing coefficients for scalar wave equation. It proposes the numerical analysis of their interpolation properties. The interpolation is local but high order convergence…
Let M be a complete Riemannian manifold whose sectional curvature is bounded above by 1. We say that M has positive spherical rank if along every geodesic one hits a conjugate point at t=\pi. The following theorem is then proved: If M is a…
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance…
This paper gives a new characterization of geodesic spheres in the hyperbolic space in terms of a ``weighted'' higher order mean curvature. Precisely, we show that a compact hypersurface $\Sigma^{n-1}$ embedded in $\H^n$ with $VH_k$ being…
This paper considers the problem of measure estimation under the barycentric coding model (BCM), in which an unknown measure is assumed to belong to the set of Wasserstein-2 barycenters of a finite set of known measures. Estimating a…
A new gridding technique for the solution of partial differential equations in cubical geometry is presented. The method is based on volume penalization, allowing for the imposition of a cubical geometry inside of its circumscribing sphere.…
We propose a discretization of classical confocal coordinates. It is based on a novel characterization thereof as factorizable orthogonal coordinate systems. Our geometric discretization leads to factorizable discrete nets with a novel…
We study the problem of estimating the barycenter of a distribution given i.i.d. data in a geodesic space. Assuming an upper curvature bound in Alexandrov's sense and a support condition ensuring the strong geodesic convexity of the…
Given a complete Riemannian manifold $M$ with a lower Ricci curvature bound, we consider barycenters in the Wasserstein space $\mathcal{W}_2(M)$ of probability measures on $M$. We refer to them as Wasserstein barycenters, which by…
Polycons, initially introduced by Wachspress in 1975 as a tool in finite element methods, are generalizations of polygons in that they allow conic boundary components. We are interested in the adjoint curve of a given polycon, i.e. the…
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the…
The paper presents a new and simple range characterization for the spherical mean transform of functions supported in the unit ball in even dimensions. It complements the previous work of the same authors, where they solved an analogous…
We extend the concepts of de Casteljau and de Boor algorithms as well as splines to geodesic spaces and present some applications in geometric modeling. The concept of weighted geometric mean provides another approach to splines. We compare…
The spherometer used for measuring radius of curvature of spherical surfaces is explicitly based on a geometric relation unique to circles and spheres. We present an alternate approach using coordinate geometry, which reproduces the…
The Cartesian coordinate system is the most commonly used system in computer visualization. This is due to its ease of use and processing speed. However, it is not always suitable for a given problem. Angular measures often allow us to…