Quasi-regular Tessellation of Hexagons

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