The super-pixel rendering algorithm maintains
a list L, of pixel clusters.
Initially, L consists of a single cluster of pixels;
that cluster describes all of R.
The rendering starts with all pixels set to 
.
On each iteration, a cluster 
is removed from L;
is then evaluated:
then 
is set to 
for all 
.
then is set to 
for all .
then is cut into several subclusters 
with 
. All of the new clusters
are added to L. The cuts are performed along pixel boundaries
so that all pixels belong to at most one member of L.
An example rendering, produced using super-pixel testing, follows:
denotes a super-pixel rendering,
where L consists of 
clusters of pixels.
Section 
will provide a motivation for keeping
cluster cuts nicely aligned, as was done above.
All intermediate renderings are renderings
of 
,
and may be presented to the user.
Another example super-pixel rendering follows:
| Jeff Tupper | March 1996 |