...
首页> 外文期刊>Discrete Applied Mathematics >On the tiling by translation problem
【24h】

On the tiling by translation problem

机译:关于平移翻译问题

获取原文
获取原文并翻译 | 示例
           

摘要

On square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes that tile the plane by translation are characterized by the Beauquier-Nivat condition. By using the constant time algorithms for computing the longest common extensions in two words, we provide a linear time algorithm in the case of pseudo-square polyominoes, improving the previous quadratic algorithm of Gambini and Vuillon. We also have a linear algorithm for pseudo-hexagon polyominoes not containing arbitrarily large square factors. The results are extended to more general tiles.
机译:在正方形或六边形格子上,瓷砖或多米诺骨牌由文字编码。通过平移将平面平铺的多米诺骨牌的特征是Beauquier-Nivat条件。通过使用恒定时间算法来计算两个单词中最长的公共扩展名,我们在伪平方多米诺骨牌的情况下提供了线性时间算法,从而改进了先前的Gambini和Vuillon二次算法。对于不包含任意大平方因子的伪六边形多胺,我们也有一个线性算法。结果扩展到更通用的图块。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号