An efficient filling algorithm for non-simple closed curves using the point containment paradigm

Abstract

The point containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. The paper presents a technique to counteract the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. The implemented algorithm handles complex geometries such as self-intersecting closed curves.