六边形的拟正则镶嵌

Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001. Pub Date : 2001-06-19 DOI:10.1109/ITI.2001.938048

B. Kaucic, B. Žalik

{"title":"六边形的拟正则镶嵌","authors":"B. Kaucic, B. Žalik","doi":"10.1109/ITI.2001.938048","DOIUrl":null,"url":null,"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. Finally, the estimation of the algorithm time complexity is done.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Quasi-regular tessellation of hexagons\",\"authors\":\"B. Kaucic, B. Žalik\",\"doi\":\"10.1109/ITI.2001.938048\",\"DOIUrl\":null,\"url\":null,\"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. Finally, the estimation of the algorithm time complexity is done.\",\"PeriodicalId\":375405,\"journal\":{\"name\":\"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITI.2001.938048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITI.2001.938048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

提出了一种均匀分布点的拟正六边形镶嵌算法。首先，介绍了所需的定义和符号。然后，给出了基于“放下棒子”类比的镶嵌算法。最后，对算法的时间复杂度进行了估计。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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. Finally, the estimation of the algorithm time complexity is done.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.

自引率

0.00%

发文量