Abstract
AbstractA crystal structure may be described by a periodic graph, so the automatic generation of periodic graphs satisfying given criteria should prove useful in understanding crystal structure and developing a theory for crystal design. We present an algorithm for constructing periodic graphs, based on a discrete variant of “turtle geometry,” which we formalize using isometries represented as affine transformations. This algorithm is given information about the putative orbits (kinds) of vertices and edges and produces a finite graph which is then collapsed into a unit cell of a periodic graph. We verify that this algorithm will generate any periodic graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have