Related papers: A Metric Framework for Triangle Inequalities via B…
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…
The author proposes a new geometry in this book. The author named this new geometry Intercenter Geometry. Intercenter Geometry is different from traditional Euclidean geometry and analytic geometry (coordinate geometry). The idea of…
In this paper, we generalize the notions of centroids and barycenters to the broad class of information-theoretic distortion measures called Bregman divergences. Bregman divergences are versatile, and unify quadratic geometric distances…
The distance between the true and numerical solutions in some metric is considered as the discretization error magnitude. If error magnitude ranging is known, the triangle inequality enables the estimation of the vicinity of the approximate…
We determine barycentric coordinates of triangle centers in the elliptic plane. The main focus is put on centers that lie on lines whose euclidean limit (triangle excess --> 0) is the Euler line or the Brocard line. We also investigate…
In this paper, we introduce an asymmetric metric on the space of marked Euclidean triangles, and we prove several properties of this metric, including two equivalent definitions of this metric, one of them comparing ratios of functions of…
Distances are pervasive in machine learning. They serve as similarity measures, loss functions, and learning targets; it is said that a good distance measure solves a task. When defining distances, the triangle inequality has proven to be a…
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,…
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…
Comparing representations across neural networks is challenging because representations admit symmetries, such as arbitrary reordering of units or rotations of activation space, that obscure underlying equivalence between models. We…
Non-Euclidean triangle centers can be described using homogeneous coordinates that are proportional to the generalized sines of the directed distances of a given center from the edges of the reference triangle. Identical homogeneous…
We give three new proofs of the triangle inequality in Euclidean Geometry. There seems to be only one known proof at the moment. It is due to properties of triangles, but our proofs are due to circles or ellipses. We aim to prove the…
A parameterization is described for quantifying translational motion of a point in three-dimensional Euclidean space. The parameterization is similar to well-known parameterizations such as spherical coordinates in that both position and…
A configuration p in r-dimensional Euclidean space is a finite collection of labeled points p^1,p^2,...,p^n in R^r that affinely span R^r. Each configuration p defines a Euclidean distance matrix D_p = (d_ij) = (||p^i-p^j||^2), where ||.||…
This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…
We study a function, which is a weighted sum of the squares of the distances of an arbitrary point to the sidelines of a triangle. The given weights, considered as barycentric coordinates, determine a point $M$. We prove that the function…
We investigate several topics of triangle geometry in the elliptic and in the extended hyperbolic plane, such as: centers based on orthogonality, centers related to circumcircles and incircles, radical centers and centers of similitude,…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
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…
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…