hrcak mascot   Srce   HID

Original scientific paper

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

Fulltext: english, pdf (82 KB) pages 21-27 downloads: 1.269* cite
APA 6th Edition
Bölcskei, A. & Szél-Koponyás, M. (2002). Construction of D-Graphs Related to Periodic Tilings. KoG, 6. (6.), 21-27. Retrieved from https://hrcak.srce.hr/3927
MLA 8th Edition
Bölcskei, Attila and Mónika Szél-Koponyás. "Construction of D-Graphs Related to Periodic Tilings." KoG, vol. 6., no. 6., 2002, pp. 21-27. https://hrcak.srce.hr/3927. Accessed 9 May 2021.
Chicago 17th Edition
Bölcskei, Attila and Mónika Szél-Koponyás. "Construction of D-Graphs Related to Periodic Tilings." KoG 6., no. 6. (2002): 21-27. https://hrcak.srce.hr/3927
Harvard
Bölcskei, A., and Szél-Koponyás, M. (2002). 'Construction of D-Graphs Related to Periodic Tilings', KoG, 6.(6.), pp. 21-27. Available at: https://hrcak.srce.hr/3927 (Accessed 09 May 2021)
Vancouver
Bölcskei A, Szél-Koponyás M. Construction of D-Graphs Related to Periodic Tilings. KoG [Internet]. 2002 [cited 2021 May 09];6.(6.):21-27. Available from: https://hrcak.srce.hr/3927
IEEE
A. Bölcskei and M. Szél-Koponyás, "Construction of D-Graphs Related to Periodic Tilings", KoG, vol.6., no. 6., pp. 21-27, 2002. [Online]. Available: https://hrcak.srce.hr/3927. [Accessed: 09 May 2021]

Abstracts
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.

Keywords
Delaney-Dress symbol; tiling in n-dimensions

Hrčak ID: 3927

URI
https://hrcak.srce.hr/3927

[croatian]

Visits: 1.533 *