Related Experiment Video
Updated: Jan 4, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
A universal algorithm for finding the shortest distance between systems of points
Igor A Blatov1, Elena V Kitaeva2, Alexander P Shevchenko2
1Volga State University of Telecommunications and Informatics, Moskovskoe sh. 77, Samara, 443010, Russian Federation.
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.
More Related Videos
Related Concept Videos
The Distance Formula
Systems of Linear Equations in Two Variables
The Midpoint Formula
Systems of Equations
Gaussian Elimination: Problem Solving
Design Example: Measuring Distance Between Two Points with Obstructions

