Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
From MaRDI portal
Publication:6182460
DOI10.46793/match.91-1.079karXiv2207.08502MaRDI QIDQ6182460
Publication date: 25 January 2024
Published in: Match - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.08502
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some properties of Gromov-Hausdorff distances
- Integral invariants for robust geometry processing
- Gromov-Wasserstein distances and the metric approach to object matching
- Decorated Teichmüller theory
- Geometric pattern matching under Euclidean motion
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Computing the minimum Hausdorff distance between two point sets on a line under translation
- Divide and conquer algorithms for the bandsymmetric eigenvalue problem
- Geometric pattern matching in \(d\)-dimensional space
- Testing congruence and symmetry for general 3-dimensional objects.
- The earth mover's distance as a metric for image retrieval
- On reconstructing \(n\)-point configurations from the distribution of distances or areas
- An isometry classification of periodic point sets
- Moduli spaces of Morse functions for persistence
- The fiber of the persistence map for functions on the interval
- Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
- A generalized solution of the orthogonal Procrustes problem
- Mathematical Methods of Organizing and Planning Production
- Moduli spaces and macromolecules
- The generalized orthogonal Procrustes problem in the high noise regime
- Computing the Gromov-Hausdorff Distance for Metric Trees
- Distance sets for shape filters and shape recognition
- Shape distributions
- Topology and data
- An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
- Improvements on geometric pattern matching problems
- Average minimum distances of periodic point sets – foundational invariants for mapping periodic crystals
- Gromov--Hausdorff Distance to Simplexes
- Testing the congruence of d-dimensional point sets
- The $n$ Body Matrix and Its Determinant
- Geometry helps in bottleneck matching and related problems
- Approximating Gromov-Hausdorff distance in Euclidean space
- Density functions of periodic sequences of continuous events
- Density functions of periodic sequences
This page was built for publication: Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
