Quasi-regular tessellation of hexagons

被引:0
|
作者
Kaucic, B [1 ]
Zalik, B [1 ]
机构
[1] Univ Maribor, PEF, SI-2000 Maribor, Slovenia
关键词
tessellation; gridded spatial data; computational geometry;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:403 / 408
页数:6
相关论文
共 50 条