hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2001.03.08

Quasi-regular Tessellation of Hexagons

Borut Žalik
Branko Kaučič

Puni tekst: engleski, pdf (496 KB) str. 227-232 preuzimanja: 874* citiraj
APA 6th Edition
Žalik, B. i Kaučič, B. (2001). Quasi-regular Tessellation of Hexagons. Journal of computing and information technology, 9 (3), 227-232. https://doi.org/10.2498/cit.2001.03.08
MLA 8th Edition
Žalik, Borut i Branko Kaučič. "Quasi-regular Tessellation of Hexagons." Journal of computing and information technology, vol. 9, br. 3, 2001, str. 227-232. https://doi.org/10.2498/cit.2001.03.08. Citirano 04.03.2021.
Chicago 17th Edition
Žalik, Borut i Branko Kaučič. "Quasi-regular Tessellation of Hexagons." Journal of computing and information technology 9, br. 3 (2001): 227-232. https://doi.org/10.2498/cit.2001.03.08
Harvard
Žalik, B., i Kaučič, B. (2001). 'Quasi-regular Tessellation of Hexagons', Journal of computing and information technology, 9(3), str. 227-232. https://doi.org/10.2498/cit.2001.03.08
Vancouver
Žalik B, Kaučič B. Quasi-regular Tessellation of Hexagons. Journal of computing and information technology [Internet]. 2001 [pristupljeno 04.03.2021.];9(3):227-232. https://doi.org/10.2498/cit.2001.03.08
IEEE
B. Žalik i B. Kaučič, "Quasi-regular Tessellation of Hexagons", Journal of computing and information technology, vol.9, br. 3, str. 227-232, 2001. [Online]. https://doi.org/10.2498/cit.2001.03.08

Sažetak
An algorithm for quasi-regular hexagon tessellation of uniformly distributed points is presented. At first, the needed definitions and notations are introduced. Then, the algorithm for the tessellation, based on "laying-down the sticks" analogy, is given. At the end, the estimation of the algorithm time complexity is done.

Hrčak ID: 44807

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

Posjeta: 1.017 *