Arbitrary Area Filling in a Fast Procedure

Simple item page
dc.contributor.authorYing, Dao-Ningen_US
dc.contributor.authorFeng, Xingen_US
dc.date.accessioned2014-10-15T08:20:13Z
dc.date.available2014-10-15T08:20:13Z
dc.date.issued1985en_US
dc.description.abstractA representation for area filling is described which allows shading of an area that may have both straight lines and circular arc edges and include holes within its boundaries. For efficiency an elimination algorithm which has a waiting line list and a currently active line list is adopted. For calculating intersections, a more time saving method is used. The algorithm and some practical examples are discussed. The main features of the algorithm are execution with high speed and less storage requirement. The program is written both in BASIC and FORTRAN 77 and could be executed on a microcomputer such as APPLE II, IBM-P/C etc. The sample outputs shown in this paper are generated by the APPLE II with high efficiency.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume4en_US
dc.identifier.doi10.1111/j.1467-8659.1985.tb00241.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages363-370en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1985.tb00241.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleArbitrary Area Filling in a Fast Procedureen_US
Files
Collections
Issue 4