New Methods for Improving the GKS Fill Area Output Primitive

Simple item page
dc.contributor.authorHerman, Ivanen_US
dc.contributor.authorReviczky, Janosen_US
dc.date.accessioned2014-10-21T05:37:37Z
dc.date.available2014-10-21T05:37:37Z
dc.date.issued1987en_US
dc.description.abstractThe 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.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume6en_US
dc.identifier.doi10.1111/j.1467-8659.1987.tb00539.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages195-201en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1987.tb00539.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleNew Methods for Improving the GKS Fill Area Output Primitiveen_US
Files
Collections
Issue 3