Original scientific paper
https://doi.org/10.2498/cit.2001.03.08
Quasi-regular Tessellation of Hexagons
Borut Žalik
Branko Kaučič
Abstract
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.
Keywords
Hrčak ID:
44807
URI
Publication date:
30.9.2001.
Visits: 1.500 *