期刊名称：Journal of Computing and Information Technology
印刷版ISSN：1330-1136
电子版ISSN：1846-3908
出版年度：2001
卷号：9
期号：3
页码：227-232
出版社：SRCE - Sveučilišni računski centar
摘要：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.
