Quasi-regular Tessellation of Hexagons

Branko Kaučič, Borut Žalik


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.

Full Text:


DOI: https://doi.org/10.2498/cit.2001.03.08

Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj

 Hrvatski arhiv weba logo