Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
From MaRDI portal
Publication:2358822
Recommendations
Cites work
- A course in metric geometry
- A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
- A theoretical and computational framework for isometry invariant recognition of point cloud data
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Computer Vision - ECCV 2004
- Diffusion maps
- Discrete geometry for computer imagery. 11th international conference, DGCI 2003, Naples, Italy, November 19--21, 2003. Proceedings
- Efficient Computation of Isometry‐Invariant Distances Between Surfaces
- Embedding Riemannian manifolds by their heat kernel
- Equality relating Euclidean distance cone to positive semidefinite cone
- Graph theory
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 477971 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- Numerical Geometry of Non-Rigid Shapes
- Quadratic assignment problems
- Some properties of Gromov-Hausdorff distances
- The complexity of low-distortion embeddings between point sets
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(24)- On \(p\)-metric spaces and the \(p\)-Gromov-Hausdorff distance
- Spatiotemporal persistent homology for dynamic metric spaces
- A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
- Some properties of Gromov-Hausdorff distances
- Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- Robust Hausdorff distance matching algorithms using pyramidal structures
- Calculation of the Gromov-Hausdorff distance using the Borsuk number
- The ultrametric Gromov-Wasserstein distance
- Distances and isomorphism between networks: stability and convergence of network invariants
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
- Gromov-Wasserstein distances and the metric approach to object matching
- Curvature sets over persistence diagrams
- Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
- Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
- Coarse and bi-Lipschitz embeddability of subspaces of the Gromov-Hausdorff space into Hilbert spaces
- Complete and continuous invariants of 1-periodic sequences in polynomial time
- Persistent homotopy groups of metric spaces
- Pointwise distance distributions for detecting near-duplicates in large materials databases
- Hausdorff vs Gromov-Hausdorff distances
- Geometry and stability of supervised learning problems
- Complete invariants of atomic clouds under rigid motion with Lipschitz continuous metrics in a polynomial time
- Stability of hypergraph invariants and transformations
This page was built for publication: Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358822)
