Abstract
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-edge-list” 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.
| Original language | English |
|---|---|
| Pages (from-to) | 41-48 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Computers |
| Volume | C-30 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1981 |
| Externally published | Yes |
Keywords
- Animation
- filled colored shapes
- frame-store
- graphics
- polygon fill
- raster scan