用GCD生成数字平面的组合技术

IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Annals of Mathematics and Artificial Intelligence Pub Date : 2023-08-28 DOI:10.1007/s10472-023-09889-4
Somrita Saha, Arindam Biswas
{"title":"用GCD生成数字平面的组合技术","authors":"Somrita Saha,&nbsp;Arindam Biswas","doi":"10.1007/s10472-023-09889-4","DOIUrl":null,"url":null,"abstract":"<div><p>A digital plane is a digitization of a Euclidean plane. A plane is specified by its normal, which is a 3D vector with integer coordinates, as considered in this case. It is established here that a 3D digital straight line segment, shifted by an integer amount, can produce the digitized plane. 3D plane’s normals are classified based on the Greatest Common Divisor (GCD) of its components, and the net code is calculated separately for each case. Experimental results are provided for several normals. Also, we show that the digital plane segment generated is a connected digital plane. The proposed method mainly involves integer arithmetic.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 1","pages":"139 - 167"},"PeriodicalIF":1.2000,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A combinatorial technique for generation of digital plane using GCD\",\"authors\":\"Somrita Saha,&nbsp;Arindam Biswas\",\"doi\":\"10.1007/s10472-023-09889-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A digital plane is a digitization of a Euclidean plane. A plane is specified by its normal, which is a 3D vector with integer coordinates, as considered in this case. It is established here that a 3D digital straight line segment, shifted by an integer amount, can produce the digitized plane. 3D plane’s normals are classified based on the Greatest Common Divisor (GCD) of its components, and the net code is calculated separately for each case. Experimental results are provided for several normals. Also, we show that the digital plane segment generated is a connected digital plane. The proposed method mainly involves integer arithmetic.</p></div>\",\"PeriodicalId\":7971,\"journal\":{\"name\":\"Annals of Mathematics and Artificial Intelligence\",\"volume\":\"92 1\",\"pages\":\"139 - 167\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2023-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Mathematics and Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10472-023-09889-4\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematics and Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10472-023-09889-4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

数字平面是欧几里得平面的数字化。平面由其法线指定,法线是一个具有整数坐标的三维矢量,如本案例所示。这里可以确定的是,三维数字直线段经过整数偏移后,就能生成数字化平面。三维平面的法线根据其分量的最大公约数(GCD)进行分类,并分别计算每种情况的净码。我们提供了几种法线的实验结果。同时,我们还证明了生成的数字平面段是一个连通的数字平面。建议的方法主要涉及整数运算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A combinatorial technique for generation of digital plane using GCD

A digital plane is a digitization of a Euclidean plane. A plane is specified by its normal, which is a 3D vector with integer coordinates, as considered in this case. It is established here that a 3D digital straight line segment, shifted by an integer amount, can produce the digitized plane. 3D plane’s normals are classified based on the Greatest Common Divisor (GCD) of its components, and the net code is calculated separately for each case. Experimental results are provided for several normals. Also, we show that the digital plane segment generated is a connected digital plane. The proposed method mainly involves integer arithmetic.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence 工程技术-计算机:人工智能
CiteScore
3.00
自引率
8.30%
发文量
37
审稿时长
>12 weeks
期刊介绍: Annals of Mathematics and Artificial Intelligence presents a range of topics of concern to scholars applying quantitative, combinatorial, logical, algebraic and algorithmic methods to diverse areas of Artificial Intelligence, from decision support, automated deduction, and reasoning, to knowledge-based systems, machine learning, computer vision, robotics and planning. The journal features collections of papers appearing either in volumes (400 pages) or in separate issues (100-300 pages), which focus on one topic and have one or more guest editors. Annals of Mathematics and Artificial Intelligence hopes to influence the spawning of new areas of applied mathematics and strengthen the scientific underpinnings of Artificial Intelligence.
期刊最新文献
Time-penalised trees (TpT): introducing a new tree-based data mining algorithm for time-varying covariates Conformal test martingales for hypergraphical models Costly information providing in binary contests Tumato 2.0 - a constraint-based planning approach for safe and robust robot behavior Calibration methods in imbalanced binary classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1