Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
How to color in a coloring book
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
An Area Shading Graphics Display System
IEEE Transactions on Computers
A new and fast contour-filling algorithm
Pattern Recognition
Hardware outline character rasterization
EGGH'91 Proceedings of the Sixth Eurographics conference on Advances in Computer Graphics Hardware: rendering, visualization and rasterization hardware
| Hi-index | 14.98 |
Contour (polygon) filling is a primitive required in many application areas of raster scan graphics. The bit-map memory in a frame-store display is computationally well suited to this task, as it provides a large scratch pad working space. In this paper, a number of contour filling algorithms based on the read/write properties of the frame-store memory are compared with the classical "ordered-edgelist" approach. Performance is evaluated on a microcomputer controlled frame-store display system in terms of ability to fill correctly, execution speed and processor memory requirements. A new algorithm, based on a more exact definition of an object edge, is presented. This algorithm, denoted edge flag algorithm, is implemented within the frame-store memory. It features high speed, in conjunction with minimal CPU memory requirements, making it ideally suited to hardware or microcode (firmware) implementation.