Izvorni znanstveni članak

Construction of D-Graphs Related to Periodic Tilings

Attila Bölcskei ; Department of Geometry, TU Budapest, Budapest, Hungary
Mónika Szél-Koponyás ; Department of Geometry, TU Budapest, Budapest, Hungary

Sažetak

This paper presents an algorithm which allows to derive classification methods concerning periodic tilings in any dimension, theoretically. By the help of this, one can check former results of the topic (e. g. [BM98, BM00]). An implementation of the algorithm yields the complete enumeration of non-isomorphic three-dimensional D-graphs with 5 elements, given as illustration.

Ključne riječi

Delaney-Dress symbol; tiling in n-dimensions

Hrčak ID:

3927

URI

https://hrcak.srce.hr/3927

Datum izdavanja:

17.2.2003.

Podaci na drugim jezicima: hrvatski

Posjeta: 2.452 *