hrcak mascot   Srce   HID

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

Puni tekst: engleski, pdf (82 KB) str. 21-27 preuzimanja: 1.244* citiraj
APA 6th Edition
Bölcskei, A. i Szél-Koponyás, M. (2002). Construction of D-Graphs Related to Periodic Tilings. KoG, 6. (6.), 21-27. Preuzeto s https://hrcak.srce.hr/3927
MLA 8th Edition
Bölcskei, Attila i Mónika Szél-Koponyás. "Construction of D-Graphs Related to Periodic Tilings." KoG, vol. 6., br. 6., 2002, str. 21-27. https://hrcak.srce.hr/3927. Citirano 29.03.2020.
Chicago 17th Edition
Bölcskei, Attila i Mónika Szél-Koponyás. "Construction of D-Graphs Related to Periodic Tilings." KoG 6., br. 6. (2002): 21-27. https://hrcak.srce.hr/3927
Harvard
Bölcskei, A., i Szél-Koponyás, M. (2002). 'Construction of D-Graphs Related to Periodic Tilings', KoG, 6.(6.), str. 21-27. Preuzeto s: https://hrcak.srce.hr/3927 (Datum pristupa: 29.03.2020.)
Vancouver
Bölcskei A, Szél-Koponyás M. Construction of D-Graphs Related to Periodic Tilings. KoG [Internet]. 2002 [pristupljeno 29.03.2020.];6.(6.):21-27. Dostupno na: https://hrcak.srce.hr/3927
IEEE
A. Bölcskei i M. Szél-Koponyás, "Construction of D-Graphs Related to Periodic Tilings", KoG, vol.6., br. 6., str. 21-27, 2002. [Online]. Dostupno na: https://hrcak.srce.hr/3927. [Citirano: 29.03.2020.]

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

[hrvatski]

Posjeta: 1.449 *