The Density Fingerprint of a Periodic Point Set
From MaRDI portal
Computational methods for problems pertaining to geometry (51-08) Finite geometry and special incidence structures (51E99) Distance geometry (51K99) Computational methods for problems pertaining to convex and discrete geometry (52-08) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Abstract: Modeling a crystal as a periodic point set, we present a fingerprint consisting of density functions that facilitates the efficient search for new materials and material properties. We prove invariance under isometries, continuity, and completeness in the generic case, which are necessary features for the reliable comparison of crystals. The proof of continuity integrates methods from discrete geometry and lattice theory, while the proof of generic completeness combines techniques from geometry with analysis. The fingerprint has a fast algorithm based on Brillouin zones and related inclusion-exclusion formulae. We have implemented the algorithm and describe its application to crystal structure prediction.
This page was built for publication: The Density Fingerprint of a Periodic Point Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6365885)
