Chapter 5

Basic raster algorithms

5.1     Raster grid, connectivity of raster grid, 4-connectivity and 8-connectivity

5.2     Bresenheim’s line algorithm

5.3     Bresenheim’s circle algorithm

5.4     Triangle filling

5.5     Flood fill algorithm

All modern computer-generated graphics are raster-based. Every image is represented as a two-dimensional array of points (called pixels from picture elements). Every pixel has coordinates which usually are a pair of integer values (x, y) and some color (see Figure 5.1).

Image

FIGURE 5.1: Example of a raster grid.

All pixels are located on the so-called raster grid, which is usually a set of points with ...

Get Computer Graphics now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.