Premium
Applying Rounding‐Up Integral Linear Interpolation to the Scan‐Conversion of Filled Polygons
Author(s) -
Yao Chengfu,
Rokne Jon G.
Publication year - 1997
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00126
Subject(s) - polygon (computer graphics) , interpolation (computer graphics) , rounding , linear interpolation , mathematics , boundary (topology) , algorithm , scan line , nearest neighbor interpolation , line integral , computation , line (geometry) , point in polygon , computer science , pixel , polygon mesh , computer vision , geometry , integral equation , image (mathematics) , mathematical analysis , polynomial , telecommunications , frame (networking) , grayscale , operating system
This paper is motivated by a special linear interpolation problem encountered in scan‐line algorithms for scan‐conversion of filled polygons. rounding‐up integral linear interpolation is defined and its efficient computation is discussed. The paper then incorporates rounding‐up integral linear interpolation into a scan‐line algorithm for filled polygons, and it discusses the implementation of the algorithm. This approach has the advantage of only requiring integer arithmetic in the calculations. Furthermore, the approach provides a unified treatment for calculating span extrema for left and right edges of the polygon that guarantees the mutual exclusiveness of the ownership of boundary pixels of two filled polygons sharing an edge.