向量代码线性插值方法形成线段

E. O. Bashkov, D. T. Obidnyk
{"title":"向量代码线性插值方法形成线段","authors":"E. O. Bashkov, D. T. Obidnyk","doi":"10.31649/1999-9941-2023-57-2-87-92","DOIUrl":null,"url":null,"abstract":"Graphic images are formed using graphic primitives. These are the smallest, indivisible from the point of view of application programs, graphic elements used as the basis for building more complex images. Among the graphic primitives, the segments of straight lines, for the formation of which provides linear interpolation, have the highest specific weight. The performance of forming a graphic scene depends on the time of vector generation, therefore the question of increasing the performance of linear interpolation is relevant, especially for dynamic images. With the use of matrix screens and matrix executive bodies in registration devices, the possibility of one-stroke reproduction of row or column elements appears, which allows you to significantly increase the speed of these devices. This mode of operation is promising. Its organization requires the development of interpolation methods that allow in one interpolation cycle to receive the increment code in a row or column (code interpolation). A coded linear interpolation method is proposed, the feature of which is determined in each interpolation clock of digital segments, which includes the number of increments of the same type with the same ordinate (abscissa). For this cycle, prepare for interpolation a larger increment of the line segment to a smaller one. In the future, this ratio and the remainder of the division are used to determine digital segments. In the proposed method, the remainder of the division of a larger increment by a smaller one is accumulated, which is equal to the smaller increment. This allows you to eliminate the accumulation of error and ensure that the end point of the straight line segment is reached. The maximum interpolation error in this case does not exceed half of the discretization step, which is due to the symmetry of the error. The code linear interpolation algorithm is proposed. The research carried out in the work can be used to build high-performance computer graphics tools.","PeriodicalId":479698,"journal":{"name":"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"VECTORS CODE LINEAR INTERPOLATION METHOD FOR FORMING LINE SEGMENTS\",\"authors\":\"E. O. Bashkov, D. T. Obidnyk\",\"doi\":\"10.31649/1999-9941-2023-57-2-87-92\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graphic images are formed using graphic primitives. These are the smallest, indivisible from the point of view of application programs, graphic elements used as the basis for building more complex images. Among the graphic primitives, the segments of straight lines, for the formation of which provides linear interpolation, have the highest specific weight. The performance of forming a graphic scene depends on the time of vector generation, therefore the question of increasing the performance of linear interpolation is relevant, especially for dynamic images. With the use of matrix screens and matrix executive bodies in registration devices, the possibility of one-stroke reproduction of row or column elements appears, which allows you to significantly increase the speed of these devices. This mode of operation is promising. Its organization requires the development of interpolation methods that allow in one interpolation cycle to receive the increment code in a row or column (code interpolation). A coded linear interpolation method is proposed, the feature of which is determined in each interpolation clock of digital segments, which includes the number of increments of the same type with the same ordinate (abscissa). For this cycle, prepare for interpolation a larger increment of the line segment to a smaller one. In the future, this ratio and the remainder of the division are used to determine digital segments. In the proposed method, the remainder of the division of a larger increment by a smaller one is accumulated, which is equal to the smaller increment. This allows you to eliminate the accumulation of error and ensure that the end point of the straight line segment is reached. The maximum interpolation error in this case does not exceed half of the discretization step, which is due to the symmetry of the error. The code linear interpolation algorithm is proposed. The research carried out in the work can be used to build high-performance computer graphics tools.\",\"PeriodicalId\":479698,\"journal\":{\"name\":\"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31649/1999-9941-2023-57-2-87-92\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31649/1999-9941-2023-57-2-87-92","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图形图像是使用图形原语形成的。这些都是最小的,从应用程序的角度来看不可分割的图形元素,用作构建更复杂图像的基础。在图形基元中,为其形成提供线性插值的直线段具有最高的比重。形成图形场景的性能取决于矢量生成的时间,因此提高线性插值性能的问题是相关的,特别是对于动态图像。通过在注册设备中使用矩阵屏幕和矩阵执行机构,出现了一行或列元素的一次复制的可能性,这使您可以显着提高这些设备的速度。这种操作方式很有前途。它的组织需要开发插值方法,允许在一个插值周期内接收一行或列中的增量代码(代码插值)。提出了一种编码线性插值方法,在数字段的每个插值时钟中确定其特征,其中包含具有相同坐标(横坐标)的相同类型增量的数量。对于这个循环,准备插值一个较大的线段增量到一个较小的。在未来,这个比例和剩余的分割被用来确定数字段。在该方法中,一个较大的增量除以一个较小的增量的余数是累积的,它等于较小的增量。这样可以消除误差的累积,并确保达到直线段的终点。在这种情况下,最大插值误差不超过离散步长的一半,这是由于误差的对称性。提出了代码线性插值算法。所开展的研究工作可用于构建高性能的计算机图形工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
VECTORS CODE LINEAR INTERPOLATION METHOD FOR FORMING LINE SEGMENTS
Graphic images are formed using graphic primitives. These are the smallest, indivisible from the point of view of application programs, graphic elements used as the basis for building more complex images. Among the graphic primitives, the segments of straight lines, for the formation of which provides linear interpolation, have the highest specific weight. The performance of forming a graphic scene depends on the time of vector generation, therefore the question of increasing the performance of linear interpolation is relevant, especially for dynamic images. With the use of matrix screens and matrix executive bodies in registration devices, the possibility of one-stroke reproduction of row or column elements appears, which allows you to significantly increase the speed of these devices. This mode of operation is promising. Its organization requires the development of interpolation methods that allow in one interpolation cycle to receive the increment code in a row or column (code interpolation). A coded linear interpolation method is proposed, the feature of which is determined in each interpolation clock of digital segments, which includes the number of increments of the same type with the same ordinate (abscissa). For this cycle, prepare for interpolation a larger increment of the line segment to a smaller one. In the future, this ratio and the remainder of the division are used to determine digital segments. In the proposed method, the remainder of the division of a larger increment by a smaller one is accumulated, which is equal to the smaller increment. This allows you to eliminate the accumulation of error and ensure that the end point of the straight line segment is reached. The maximum interpolation error in this case does not exceed half of the discretization step, which is due to the symmetry of the error. The code linear interpolation algorithm is proposed. The research carried out in the work can be used to build high-performance computer graphics tools.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ANALYSIS OF THE ARCHITECTURE OF SUCCESSIVE APPROXIMATION REGISTER ADC AND APPROACHES TO ITS IMPROVEMENT IMPROVEMENT OF ASSIGNING TASKS METHOD FOR THE VEHICLE MAINTENANCE EMPLOYEES BASED ON GENETIC AND HUNGARIAN ALGORITHMS IMPLEMENTATION OF ARBITRARY BITNESS PERMUTATIONS BASED ON COMBINED CASCADES OF STRUCTURAL UNITS OBJECT-ORIENTED IMPLEMENTATION OF A WEB APPLICATION FOR TRAFFIC SIMULATION DECISION-MAKING SUPPORT SYSTEM FOR DETERMINING THE FITNESS OF SCIENTIFIC AND EDUCATIONAL ACTIVITY OBJECTS TO SCIENTIFIC AND EDUCATIONAL FIELDS AND SPECIALTIES
×
引用
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