摘要: The paper discusses algorithms for filling contours in raster graphics. Its major feature is the use of line adjacency graph contour order to fill correctly nonconvex and multiply connected regions, while starting from a “seed.” Because same used “parity check” algorithm, two types can be combined into one. This combination useful either finding seed through parity check, or resolving ambiguities on basis connectivity.