Beschreibung:
<jats:p>A boundary-defined filling algorithm for arbitrary regions and filling patterns is presented. It has the completeness property of Shani's graph-based algorithm, but avoids the necessity of drawing additional "blocking lines" between the cycle-sensitive subregions.</jats:p>