New Methods for Improving the GKS Fill Area Output Primitive

Abstract

The fill area primitive is one of the most powerful primitives of GKS and its derivatives (GKS-3D, PHIGS etc.). Since its specrfication is extremely general, it is important to explore new approaches to achieve higher performance in its implementation. In this paper fast algorithms are presented for special situations, which can be included, together with appropriate tests, into a complete GKS output pipeline. As a result, a speed improvement With a factor of two may be achieved in important practical cases.