Next: 4.1.3 Progressive Rendering
Up: 4.1 Graphs
Previous: 4.1.1 Rendering
We assume each pixel can take on one of two colours, and that
all patterns may be realized.
The rendering R represents the graph G[S] if
where
For any given graph G, there is a unique rendering R which represents it.
The information contained in the colour of is summarized
in the following table:
Next: 4.1.3 Progressive Rendering
Up: 4.1 Graphs
Previous: 4.1.1 Rendering