The asymptotic behaviour and a near linear time algorithm for isometry invariants of periodic sets

The fundamental model of a periodic structure is a periodic point set up to rigid motion or isometry. Our recent paper in SoCG 2021 defined isometry invariants (density functions), which are complete in general position and continuous under perturbations. This work introduces much faster isometry invariants (average minimum distances), which are also continuous and distinguish some sets that have identical density functions. We explicitly describe the asymptotic behaviour of the new invariants for a wide class of sets including non-periodic. The proposed near linear time algorithm processed a dataset of hundreds of thousands of real structures in a few hours on a modest desktop.

[1]  H. Edelsbrunner,et al.  The Density Fingerprint of a Periodic Point Set , 2021, SoCG.

[2]  V. Kurlin,et al.  Introduction to Periodic Geometry and Topology , 2021, ArXiv.

[3]  Jean-Louis Reymond,et al.  Visualization of very large high-dimensional data sets as minimum spanning trees , 2019, Journal of Cheminformatics.

[4]  Nikolai P. Dolbilin,et al.  Regular t-bonded systems in R3 , 2019, Eur. J. Comb..

[5]  Nikolai P. Dolbilin,et al.  Regular and Multi-regular t-bonded Systems , 2017, J. Inf. Process..

[6]  Christopher M. Kane,et al.  Functional materials discovery using energy–structure–function maps , 2017, Nature.

[7]  Günter Rote,et al.  Congruence Testing of Point Sets in 4 Dimensions , 2016, ArXiv.

[8]  Russell A. Brown,et al.  Building a Balanced k-d Tree in O(kn log n) Time , 2014, ArXiv.

[9]  Facundo Mémoli,et al.  Gromov–Wasserstein Distances and the Metric Approach to Object Matching , 2011, Found. Comput. Math..

[10]  Daniel Cremers,et al.  Integral Invariants for Shape Matching , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  James A. Chisholm,et al.  COMPACK: a program for identifying crystal structure similarity using distances , 2005 .

[12]  Nicolai Petkov,et al.  Distance sets for shape filters and shape recognition , 2003, IEEE Trans. Image Process..

[13]  Mireille Boutin,et al.  On reconstructing n-point configurations from the distribution of distances or areas , 2003, Adv. Appl. Math..

[14]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[15]  Jeffrey C. Lagarias,et al.  Multiregular Point Systems , 1998, Discret. Comput. Geom..

[16]  F. Grünbaum,et al.  The use of higher-order invariants in the determination of generalized Patterson cyclotomic sets , 1995 .

[17]  Kurt Mehlhorn,et al.  Congruence, similarity, and symmetries of geometric objects , 1987, SCG '87.

[18]  Herbert J. Bernstein,et al.  A perturbation stable cell comparison technique , 1980 .

[19]  Vitaliy Kurlin,et al.  An Isometry Classification of Periodic Point Sets , 2021, DGMM.

[20]  C. A. Rogers,et al.  An Introduction to the Geometry of Numbers , 1959 .