Pointwise distance distributions of periodic sets

6 The fundamental model of a periodic structure is a periodic set of points considered up to rigid 7 motion or isometry in Euclidean space. The recent work by Edelsbrunner et al defined the new 8 isometry invariants (density functions), which are continuous under perturbations of points and 9 complete for generic sets in dimension 3. This work introduces much faster invariants called higher 10 order Pointwise Distance Distributions (PDD). The new PDD invariants are simpler represented 11 by numerical matrices and are also continuous under perturbations important for applications. 12 Completeness of PDD invariants is proved for distance-generic sets in any dimension, which was also 13 confirmed by distinguishing all 229K known molecular organic structures from the world’s largest 14 Cambridge Structural Database. This huge experiment took only seven hours on a modest desktop 15 due to the proposed algorithm with a near linear or small polynomial complexity in terms of key 16 input sizes. Most importantly, the above completeness allows one to build a common map of all 17 periodic structures, which are continuously parameterized by PDD and explicitly reconstructible 18 from PDD. Appendices include first tree-based maps for several thousands of real structures. 19 2012 ACM Subject Classification Theory of computation → Computational geometry 20

[1]  P. Seymour,et al.  The Structure of Homometric Sets , 1982 .

[2]  Kalpana C. Jondhale,et al.  Shape matching and object recognition using shape contexts , 2010 .

[3]  Geoffrey E. Hinton,et al.  Visualizing Data using t-SNE , 2008 .

[4]  Jiaolong Yang,et al.  Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  John Langford,et al.  Cover trees for nearest neighbor , 2006, ICML.

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

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

[8]  P. Zwart,et al.  Surprises and pitfalls arising from (pseudo)symmetry , 2007, Acta crystallographica. Section D, Biological crystallography.

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

[10]  Yaron Lipman,et al.  Point registration via efficient convex relaxation , 2016, ACM Trans. Graph..

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

[12]  Johannes Wallner,et al.  Integral invariants for robust geometry processing , 2009, Comput. Aided Geom. Des..

[13]  Neil J. A. Sloane,et al.  Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[14]  Vitaliy Kurlin,et al.  Introduction to Periodic Geometry and Topology , 2021, ArXiv.

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

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

[17]  Christoph Ortner,et al.  Incompleteness of Atomic Structure Representations. , 2020, Physical review letters.

[18]  Kurt Mehlhorn,et al.  Weisfeiler-Lehman Graph Kernels , 2011, J. Mach. Learn. Res..

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