Abstract

In image analysis and computer graphics there are many different application problems which require the computation (and drawing) of binary and multi-tone (colored) digital polygonal masks. It is necessary to clarify that ’binary digital polygonal mask’ should be understood as to mean a (0-1) image where the set of pixels with value 1 describe a digital planar polygon of arbitrary number of vertices. In other words, if P denotes a digital planar polygon, we would like to obtain an image I_s such that More generally, we may be given more than one polygon in the same image. In this case, we would like to assign different codes to each polygon in the image. In other words, if Q₁, Q₂,…,Q_d are the given polygons (whose interiors are assumed disjoint), we wish to obtain an image I_m such that for all k=1,…,d where c’s, d’s are different codes, and ${\dot{\text{Q}}}_k$ denotes the interior of the polygon Q_k.

© 1985 Optical Society of America