PROPERTIES AND EFFICIENT ALGORITHMIC DETERMINATION OF DIFFERENT CLASSES OF RINGS IN FINITE AND INFINITE POLYHEDRAL NETWORKS

被引:89
作者
GOETZKE, K
KLEIN, HJ
机构
[1] Institut für Informatik und Praktische Mathematik, Universität Kiel, 23 Kiel
关键词
Crystallography - Mathematical Models - Mathematical Techniques - Algorithms;
D O I
10.1016/0022-3093(91)90145-V
中图分类号
TQ174 [陶瓷工业]; TB3 [工程材料学];
学科分类号
0805 ; 080502 ;
摘要
Different definitions of rings in polyhedral networks are considered and some of their properties are discussed. An efficient algorithm is presented for the automatic determination of rings in finite as well as in infinite networks. A sketch is given of the proof that there is always an upper limit to the length of rings in any crystal.
引用
收藏
页码:215 / 220
页数:6
相关论文
共 11 条