Describe (in image algebra) a fast algorithm to determine if an image
of a simple closed curve (representing the boundary of an object) is
4-connected or not.
Your algorithm does not need to (but is allowed to) function correctly
for arbitrary regions rather than curves.
By fast, I mean using as few operations per pixel as you know how to use.
This document is copyright 1994 by Joseph N. Wilson.
$Id$