Discovery of accurate and far more efficient algorithm for point set registration problems

Point set registration problems, i.e. finding corresponding points between shapes represented as point sets, are important in a variety of fields, so algorithms have been developed. Here, a new algorithm is discovered for point set registration problems. This algorithm is demonstrated to solve several typical problems remarkably faster than conventional methods and with the highest accuracy. This novel algorithm will be beneficial to a wide variety of technologies including computer graphics, computer vision, authentication etc.