{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
