Shading of regions on vector display devises

Abstract

Given an arbitrary simple polygon with N vertices we present an algorithm for shading the interior of the polygon with a set of parallel lines where the slope and the distance between lines are prespecified. If the number of shading line segments is M, the algorithm described in the paper runs in 0(N log N + M) time. The algorithm is generalizable to shade any region or regions of an arbitrary planar subdivision.