Abstract <p>The concept of dense plain atomic nets in crystal structures is commonly used in descriptive and comparative crystal chemistry and in polytype studies. To automatize the search of such nets, algorithms based on the Fourier analysis of atomic positions in unit cells have been developed since 1980s. However, these approaches have a number of limitations. As an alternative and addition to Fourier approaches, we propose a cluster analysis algorithm in the direct space and consider its implementation in the <i>nets</i> module of a the crystchemlib open-source Python library.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Search of Dense Plain Nets in Crystal Structures by Cluster Analysis

  • S. V. Rashchenko

摘要

Abstract

The concept of dense plain atomic nets in crystal structures is commonly used in descriptive and comparative crystal chemistry and in polytype studies. To automatize the search of such nets, algorithms based on the Fourier analysis of atomic positions in unit cells have been developed since 1980s. However, these approaches have a number of limitations. As an alternative and addition to Fourier approaches, we propose a cluster analysis algorithm in the direct space and consider its implementation in the nets module of a the crystchemlib open-source Python library.