The Gromov-Hausdorff distances to simplexes
From MaRDI portal
Publication:5110051
Abstract: Geometric characteristics of metric spaces that appear in formulas of the Gromov--Hausdorff distances from these spaces to so-called simplexes, i.e., to the metric spaces, all whose non-zero distances are the same are studied. The corresponding calculations essentially use geometry of partitions of these spaces. In the finite case, it gives the lengths of minimal spanning trees. A similar theory for compact metric spaces was worked out previously. In the present paper we generalize those results to any bounded metric space, and also, we simplify some proofs.
Recommendations
Cited in
(15)- Contiguity distance between simplicial maps
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
- Gromov hyperbolicity of the Hilbert distance
- Calculation of the Gromov-Hausdorff distance using the Borsuk number
- Gromov-Hausdorff distances from simply connected geodesic spaces to the circle
- Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation
- The Gromov-Hausdorff distance between vertex sets of regular polygons inscribed in a single circle
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- Gromov-Hausdorff distance between interval and circle
- Geometry of the Gromov-Hausdorff distance on the class of all metric spaces
- Some properties of Gromov-Hausdorff distances
- The Heegaard distances cover all nonnegative integers
- Estimates of Gromov's box distance
- Gram matrix analysis of finite distance spaces in constant curvature
- Path connectivity of spheres in the Gromov-Hausdorff class
This page was built for publication: The Gromov-Hausdorff distances to simplexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110051)