2019
DOI: 10.1107/s2053273319011628
|View full text |Cite
|
Sign up to set email alerts
|

A universal algorithm for finding the shortest distance between systems of points

Abstract: Three universal algorithms for geometrical comparison of abstract sets of n points in the Euclidean space R3 are proposed. It is proved that at an accuracy ϵ the efficiency of all the algorithms does not exceed O(n3/ϵ3/2). The most effective algorithm combines the known Hungarian and Kabsch algorithms, but is free of their deficiencies and fast enough to match hundreds of points. The algorithm is applied to compare both finite (ligands) and periodic (nets) chemical objects.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 25 publications
0
5
0
Order By: Relevance
“…Internal coordinates (bonds lengths, bond and torsion angles) and pore dimensions (minimum and maximum diameters, shape, topology of communication). 65–70…”
Section: Topological Methods For the Description Of Reconstructive Tr...mentioning
confidence: 99%
See 1 more Smart Citation
“…Internal coordinates (bonds lengths, bond and torsion angles) and pore dimensions (minimum and maximum diameters, shape, topology of communication). 65–70…”
Section: Topological Methods For the Description Of Reconstructive Tr...mentioning
confidence: 99%
“…Internal coordinates (bonds lengths, bond and torsion angles) and pore dimensions (minimum and maximum diameters, shape, topology of communication). [65][66][67][68][69][70] 2. Relative placement of structural groups due to their slipping with respect to each other.…”
Section: Left)mentioning
confidence: 99%
“…The overall order of the procedure is therefore well below , where N is the total number of atoms (see also Section ). In addition, contrary to the uniform grid proposed in ref , our approach does not require blind and massive checks on the number of grid points and their completeness in parsing the rotation space/manifold.…”
Section: Our Approachmentioning
confidence: 99%
“…Local minima are a consequence of structural symmetries; see also Figure . The authors in ref suggested an algorithm in which the space of possible rotations and reflections is discretized into a uniform grid of points. For each grid-point R , the optimal atomic assignment P B is obtained as the optimal assignment of an interstructure distance matrix with the Hungarian algorithm, which is then used to minimize rotations with SVD .…”
Section: Introductionmentioning
confidence: 99%
“…Finally, crystal structures are compared (not successfully for Heusler structures [ 8 ] ) by powder diffraction patterns up to a cut off radius, which brings discontinuities similarly to other parameters. To the best of our knowledge [ 9 ] there was no distance on equivalence classes of crystal structures that satisfies all metric axioms (2.3a), (2.3b), (2.3c), and continuity (2.3d).…”
Section: Strengths and Weaknesses Of Past Approaches To A Similarity mentioning
confidence: 99%