The display of shaded polygons, either by lines, crosshatching, dots, or continuous color patterns is a task frequently used in many application areas of computer graphics. In applications such as the production of hidden surface images, cartography, and animation, algorithm efficiency is important. In this paper, a new fill algorithm is presented which will fill an arbitrary polygon in the plane.-'No sorting is required and the algorithm is suitable for microprocessor or hardware implementation.
No takes yet. Share an insight, caveat, or question.
Lane et al. (1983) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: