Stroking discrete polynomial Bezier curves via point containment paradigm

The point containment predicate which specifies if a point is part of a mathematically defined shape or not is a crucial problem in computer graphics. This paper presents a stroking technique that counteracts the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. It is also presented an efficient algorithm to perform simultaneously the filling and stroking operations.