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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.