Search arXivSearch

arXiv · 2608.23267

An Approach to Study the Structural Consistency of Triangle Badness Functions and Distance Metrics

Abstract

Triangle-based measures, commonly referred to as badness functions, are widely employed to quantify the extent to which a distance matrix deviates from an ideal geometric configuration. Different formulations of these functions may capture distinct facets of local non-uniformity, and their behavior is often influenced by the underlying distance metric chosen for evaluation. In practical settings, although a canonical badness function may be conceptually preferred, factors such as computational cost, algorithmic constraints, or data-specific characteristics frequently necessitate the adoption of modified versions-for instance, approximate forms or alternatives defined under different distance metrics. This gives rise to a central question: to what degree do these variants retain the structural consistency properties of their original counterparts? To address this issue, we develop a systematic correlation-based framework for evaluating structural consistency. As an illustrative instantiation of this framework, we compute badness sequences from a set of representative distance matrices alongside randomly generated triangle configurations, which are designed to cover variants that may arise under diverse practical scenarios. We then assess pairwise similarities among these sequences using four correlation coefficients. The experimental outcomes indicate that certain badness variants exhibit a notably high degree of structural consistency, whereas others reveal complementary behavioral patterns; moreover, the choice of distance metric exerts a considerable influence on the observed trends. These findings offer practical insights for the informed selection of distance metrics and triangle badness function variants in tasks including geometric reconstruction, triangulation, and structural analysis of pairwise distance data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bowen Liu, Yizhou Wang, Lingqian Meng. 2026-08-24. An Approach to Study the Structural Consistency of Triangle Badness Functions and Distance Metrics. https://arxiv.org/abs/2608.23267

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The disjoint disks property for Busemann $G$-spaces

We prove that every finite-dimensional Busemann \(G\)-space of dimension at least five has the disjoint disks property (DDP). For a sufficiently small metric sphere \(L=S(c,r)\), we show that every embedded arc contained in an exact distance level is a homotopical \(Z_2\)-set in \(L\). It follows that \(L\) has the disjoint arc-disk property and the disjoint homotopies property. Daverman's product theorem then gives DDP for \(L\times\mathbb R\), and a local avoidance argument at the center yields DDP for the ambient \(G\)-space. Since finite-dimensional Busemann \(G\)-spaces are generalized manifolds, in dimensions at least five the remaining obstruction to the Busemann conjecture is the resolution problem.

math.MG

Every Compact Metric Space Is Isometrically Embeddable into the Gromov-Hausdorff Space

Let $(\mathcal{M},d_{\mathrm{GH}})$ denote the Gromov-Hausdorff space of isometry classes of nonempty compact metric spaces. We prove that every nonempty compact metric space is isometrically embeddable into $(\mathcal{M},d_{\mathrm{GH}})$. More precisely, for every $D>0$ and every nonempty compact metric space $K$ with $\operatorname{diam} K\le D$, we realize the space of all $1$-Lipschitz functions on $K$ with values in $[0,D]$ as a family of metrics on a fixed Cantor space. Under this realization, the Gromov-Hausdorff distance agrees exactly with the uniform distance between functions, and each resulting metric space has diameter at most $76D$. We also construct finite approximations for which the Gromov-Hausdorff distance is given by an exact formula, together with a uniform approximation estimate.

math.MG

Measure contraction property on isometric leaves and monotone fibres

For finite measures with positive densities on convex Euclidean supports, we prove that $MCP(κ,N)$ passes with unchanged parameters to almost every isometric leaf of an arbitrary nonexpansive map. The proof rests on a sharp contraction inequality for geometric conditional densities, with exponent equal to the leaf codimension. The inherited dimension parameter is optimal. A total-variation limit on resolvent graphs extends the result to inverse fibres of maximal monotone relations, including convex gradient fibres. We also disprove Klartag's curvature-dimension inheritance conjecture by a firmly nonexpansive example in dimension three and a gradient example in dimension four. In codimension one, affinity of the geometric density yields curvature-dimension inheritance. The first example also gives failure on monotone fibres. Both constructions admit arbitrarily large curvature loss, including for a fixed Gaussian ambient measure on families of leaves of positive quotient measure.

math.MG